anonymous
  • anonymous
Here is one from number theory... Prove that there are infinitely many primes.....
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
4p+3 will be a prime for all prime p lets assume p is the last prime then 4p+3 is also a prime this contradicts our assumption hence there are infinitly many primes
anonymous
  • anonymous
but how can u tell that 4p+3 is a prime?
anonymous
  • anonymous
as p is prime 4p is multiple of 1,2 4,p if you add three nothing factors out so it is a prime

Looking for something else?

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

More answers

anonymous
  • anonymous
as for me, i've heard of these proofs: Euclid's Proof (c. 300 BC) Furstenberg's Topological Proof (1955) Goldbach's Proof (1730) Kummer's Restatement of Euclid's Proof Filip Saidak's Proof (2005)
anonymous
  • anonymous
Yeah sure
phi
  • phi
4*13+3 = 55 which is composite to do your proof, you must create the number formed by multiplying ALL primes less than or equal the presumed last prime. then add 1. this number will be divisible by all smaller primes, but with a remainder of 1. So there must be a bigger prime than the presumed last prime.

Looking for something else?

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