
Re: Musatov Prime Generalization Conjecture
Posted:
Jul 8, 2009 1:17 AM


In article <01ecf30115ba4bfb83c3f4e8e18c9083@o18g2000pra.googlegroups.com>, Constructive Truth <scriber17@aol.com> wrote:
>I am afraid, necessarily you misunderstand the direct language of my >claim. > >My claim is: > >1. every prime is of the form 2N+1.
Not only is your statement trivial and completely uninteresting (every prime number is odd. Really? Could that be because even numbers are, by definition, divisible by 2, and thus not prime?), it isn't even completely correct. 2 is a prime, but is not of the form 2N+1.
So your claim is both trivial and false. Have no fear! One minor change:
MusatovMorgan Theorem Every prime > 2 is of the form 2N+1
and it's now trivial and true. What's next? A variation on the Goldbach Conjecture where you hypothesize that every number > 2 can be written as the sum of two other numbers?
Alan  Defendit numerus

