Simple proof

From: "Fermat" <mitroister@xxxxxxxxx>
Date: 7 Dec 2005 11:40:01 -0800

Hello,

I am doing some research in additive number theory, and i have a
theorem i should say since i proved it already, but i would like to see
how other might prove it.

Conjecture

Let n be a positive even integer. n can be written as the sum of two
numbers in n/2 ways, without repetition.

Thank you.

.

Follow-Ups:
- Re: Simple proof
  - From: Randy Poe
- Re: Simple proof
  - From: [Mr.] Lynn Kurtz

Prev by Date: Re: Well Ordering the Reals
Next by Date: Re: Well Ordering the Reals
Previous by thread: Integral extensions/Finitely generated question
Next by thread: Re: Simple proof
Index(es):
- Date
- Thread

Relevant Pages

Re: Simple proof
... n can be written as the sum of two ... The correct statement would be ... > positive numbers in n/2 ways, without repetition. ...
(sci.math)
Re: Simple proof
... >numbers in n/2 ways, without repetition. ... You mean sum of two positive integers: ... Prev by Date: ...
(sci.math)
Re: what makes it true?
... mathematical theorem: if Goldbach's conjecture ... greater than 2 is the sum of two primes. ... Prev by Date: ...
(sci.math)
Re: VLookup returns #VALUE!
... which interferes with =SUM ... > I'm stuck. ... Prev by Date: ...
(microsoft.public.excel.worksheet.functions)
Eliminate unused columns
... is there a smarter way to do the conversion than sum across an fill ... Prev by Date: ...
(microsoft.public.excel.misc)