Jump to content

Polignac's Conjecture


RK4
 Share

Recommended Posts

This conjecture states that:

 

Every odd positive integer is the sum of a prime and a power of two.

 

Obviously this conjecture was proved false as a counterexample was found:

 

509

 

But, how do I prove that 509 is not the sum of a prime and a power of two?

 

After that, what's the next smallest counterexample after 509?

Link to comment
Share on other sites

I thought Polignac stated that any even number can be written as a difference of primes in an infinite number of ways (a more general version of the twin-prime conjecture) ?

 

<after quickly Googling>

 

But this conjecture (odd = prime + power of 2) also appears to be attributed to Polignac. There's another counterexample at 877, but I'm not sure if this is the next one. The smallest counterexample is 127. It looks like many of these numbers are themselves primes.

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
 Share

×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.