jhonyy9
  • jhonyy9
prove that every prim p>2 can be writing in the form of 2n+1 for n>0 ,n number natural,so p-1=2n --- p-1 --- even,because p is odd. so p>2 --- than p>=3 p is prim,p>2 so than p is even so p=2k+1,where k=1,2,3,...,n. so p=2k+1 --- subtract 1 from both sides,than p-1=2k 2n=p-1=2k so 2n=2k --- divide both sides by 2 n=k - so for every p prims there are n>=1,n natural , such that p=2n+1 - is this correct,right ?
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
By division algorithm, every integer can be written in the form 2k or 2k+1.Primes are those which do not have ANY factors except 1 and itself.Thus, the form 2k is out of bounds for k>1. Thus, every prime >2 is of the form 2k+1
jhonyy9
  • jhonyy9
ok but how to prove it this ?
anonymous
  • anonymous
That IS the proof!

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

jhonyy9
  • jhonyy9
what ? can you write this here ?
anonymous
  • anonymous
1.Every int can be written as 2k or 2k+1. 2.The int 2k is divisible by 2.Thus it is not a prime for k>1 3.The conclusion follows.

Looking for something else?

Not the answer you are looking for? Search for more explanations.