All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Primary Problem (Posted on 2002-08-21) Difficulty: 4 of 5
Prove that there exists an infinitely large number of primes.

See The Solution Submitted by Dulanjana    
Rating: 3.5000 (8 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution suppose not | Comment 2 of 13 |
if there were a prime number that was the largest one...then what would happen if you took all the prime numbers less than and including that number and multiplied them all together and then added 1. i'll tell you what would happen! that new, bigger number would either be a new prime number bigger than the biggest prime number or it would be a composite number that must have a prime factor bigger than the biggest prime number (both of these contradict the suppostion that there is a biggest prime number). therefore there is no biggest prime number.
  Posted by danny on 2002-11-04 14:57:59
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information