Hi everybody,

Does anyone have more info (or a counter example) about:

Any odd prime P can be written in form:

where p is prime and

In fact i think that every odd number can be written in the above form

Thank you a lot.

Printable View

- October 20th 2009, 01:30 PMgdmathA conjecture involving primes
Hi everybody,

Does anyone have more info (or a counter example) about:

Any odd prime P can be written in form:

where p is prime and

*In fact i think that every odd number can be written in the above form*

Thank you a lot. - October 20th 2009, 04:25 PMBingk
Well, there's a slight problem ... 3 = 2 + 1, and I'm assuming that we're not considering 1 to be prime ... so then a = 0 (a is alpha ... too early for me to be using latex, hehehe). So you should allow for a = 0 :).

Just some other things, for odd primes, it's obvious that P = p + 2n ... i.e. the difference between any odd primes is even :).

As for P = p + 2^a, we might be able to reconstruct P so that since where is the next prime before P, then where is the next prime before , so we keep doing this until we get where ... and I guess it's up to you to show that it's possible ... or not :)

Also, not quite the same, but you might want to look up the twin primes conjecture (and related/modified conjectures), it might give you some ideas .... - October 20th 2009, 04:33 PMBingk
Ah ... here's another idea ... instead of breaking it down, you can try to build up ...

like consider all primes of the form 3 + 2^a, 5 + 2^a, ... , p + 2^a, ... and check if that covers all odd primes (maybe you could show that it covers all odd numbers? so all odd numbers can can be written in that form, and all odd numbers includes all odd primes ....) - October 20th 2009, 09:35 PMchisigma
Counterexample: [prime...], [>1...], [not a prime...]

Kind regards

- October 20th 2009, 10:31 PMgdmath
- October 21st 2009, 05:00 AMBingk
gdmath ... I just got another idea for the second method.

Firstly, aside from the case of P=3, I think p is also an odd prime (since if p=2, and we add 2^a, then we just get even numbers)

So, we start with when p=3, and we consider the set of all odd integers of the form 3+2^a. This is {5,7,11,19,35,...}. We can see that the gap gets bigger as a increases (I get the feeling that it would also help to analyze this as a sequence/series).

Then, we consider the next prime, when p=5. 5+2^a will give us {7,9,13,21,37,...}. We keep doing this, and what you will notice is that we fill up the gaps :) ... so if any odd number O can be written in the form O = p + 2^a, then any odd prime can be written in this form :). - October 21st 2009, 07:57 AMOpalg
127 looks like a counterexample.

- October 21st 2009, 08:34 AMgdmath
- October 21st 2009, 07:31 PMBruno J.
- October 21st 2009, 10:50 PMgdmath
I do not think that i understand the purpose of your scoffing quote.

Anyway - since you mensioned it - I work on arbitary arithmetic patterns (for computer analysys). From there i come, ussualy upon some curious relations and i want to know if they exist or no.

As far it concern Gauss ... i do not know what of his quotes you have in mind but forgive me i do not care to know. - October 21st 2009, 11:22 PMBruno J.
Sorry, I didn't mean to offend. However it seems that you posted this conjecture because you didn't feel like verifying it by yourself, preferring to leave the work up to somebody else. (By "verification", I mean checking more than the primes less than 150, of which there are only 35.) As it turns out, you wouldn't have needed to search very far to realize that the conjecture is false.

By no means do I want to discourage you from searching for mathematical truth. But there are better ways than to stumble into a dark alley, to pick up an old hat that's lying there, conjecture that it's a cat and send it to a laboratory for analysis to make sure that it is. Simply walking out of the alley and into the dimmest of streetlights will reveal its true nature. - October 21st 2009, 11:31 PMgdmath
Sorry for me also if iwas offensive.

You also are partially right, I should be more carefull for the threads I post.

Thank you - October 21st 2009, 11:43 PMBruno J.
We're all good my friend! Good luck in your endeavours. (Bow)