Bruno
Admin
Posts : 184
Join date : 2009-09-15
Age : 36
Location : the infinite, frictionless plane of uniform density
 | | Subject: Writing integers as sums of primes Sun Dec 20, 2009 4:20 pm | |
| Include 1 as a prime for this problem (blasphemy!  ). Show that every integer is the sum of distinct primes. | |
|
Mitch
Pythagoras
Posts : 4
Join date : 2009-09-16
| | Subject: Goldbach Thu Jan 14, 2010 11:50 pm | |
| This reminds me of another problem. Show that every even integer greater than two can be written as the sum of two primes.
Note that they don't have to be distinct and 1 does not count as a prime in this case.
Kudos to any of you that solve this problem...Let's say it's a bit of a tough one... | |
|
Bruno
Admin
Posts : 184
Join date : 2009-09-15
Age : 36
Location : the infinite, frictionless plane of uniform density
| | Subject: Re: Writing integers as sums of primes Fri Jan 15, 2010 2:17 pm | |
| - Mitch wrote:
- This reminds me of another problem. Show that every even integer greater than two can be written as the sum of two primes.
Note that they don't have to be distinct and 1 does not count as a prime in this case.
Kudos to any of you that solve this problem...Let's say it's a bit of a tough one... What's up Mitch! I haven't seen you in a while!  The problem you are giving is quite hard indeed! Here's a plot of the number of representations of each even integer as a sum of two primes. It looks very nice!  My problem above is easier, rest assured. | |
|
Sponsored content
| | Subject: Re: Writing integers as sums of primes | |
| |
|
