Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: conjecture on sums of primes
Replies: 13   Last Post: Apr 18, 2013 12:45 AM

 Messages: [ Previous | Next ]
 piman314@gmail.com Posts: 4 Registered: 4/17/13
Re: conjecture on sums of primes
Posted: Apr 17, 2013 2:12 PM

On Saturday, February 4, 2012 3:39:52 PM UTC+8, Butch Malahide wrote:
> On Feb 2, 3:35 am, Paul <pepste...@gmail.com> wrote:
>

> > I conjecture that, for all integers N > 1, there exists an integer E
>
> > such that E can be expressed as the sum of two primes in more than N
>
> > different ways.
>
> >
>
> > Is this conjecture true, false, or unknown?
>
>
>
> It follows from the existence of arbitrarily long arithmetic
>
> progressions of primes:
>
>
>
> https://en.wikipedia.org/wiki/Green%E2%80%93Tao_theorem

Yes! I found it as I was *describing* the problem to ask for help from this thread :) :

There's a sequence of K primes, all spaced-out evenly, for any size K. How can you say that there are more than N ways to build-up the same integer using those primes taken 2 at a time? (for any N). (You must use only *those* primes because an 'outside' plus one of those primes, would produce a bunch of different integers, over all those primes).

The answer is sort-of a Gaussian thing: You can take almost any two of the K primes, let's say the bottom and the top ones. Those two added together make an integer E. Add the next-one-up to the next-one-down, and you get the same integer E! And so on, provided you have enough (K) primes to make at least N+1 pairs.
~~~

Date Subject Author
2/2/12 Paul
2/2/12 Richard Tobin
2/2/12 Paul
2/2/12 Richard Tobin
2/2/12 Thomas Nordhaus
2/2/12 Don Redmond
2/3/12 gnasher729
2/4/12 Butch Malahide
2/7/12 Richard Tobin
4/17/13 piman314@gmail.com
4/17/13 piman314@gmail.com
4/17/13 piman314@gmail.com
4/17/13 piman314@gmail.com
4/18/13 David Petry