The proof that there is no largest prime:
Assume that there are a finite number of primes for the sake of contradiction. Then, there should be a number P that equals p1p2p3...pn+1. P is either prime or not prime (composite). If it is prime, we just show that P is larger than the largest prime in the list. If it's not prime, it must be composite. Composite always has at least one factor that is prime, but since P is not divisible by any prime in the list, the unknown prime factor(s) must be something not in the list, this also shows that there is a prime larger than the largest prime in the list. Both cases show that no matter how large a list of prime numbers, there will be always at least one larger prime outside of that list.
euclid wanted to prove that things were true by using logic and reason.
Euclid (c. 300 BC) was one of the first to prove that there are infinitely many prime numbers. His proof was essentially to assume that there were a finite number of prime numbers, and arrive at a contradiction. Thus, there must be infinitely many prime numbers. Specifically, he supposed that if there were a finite number of prime numbers, then if one were to multiply all those prime numbers together and add 1, it would result in a number that was not divisible by any of the (finite number of) prime numbers, thus would itself be a prime number larger than the largest prime number in the assumed list - a contradiction.
Euclid was a Greek mathematician, and is called the father of geometry. A prime number is any number that can only be divided by itself and one. There are an infinite number of prime numbers. As a mathematician Euclid was interested the pursuit of knowledge for knowledge's sake and in proving that things could be quantified (how many, how much). In the case of primes the answer of "there are an infinitely large number of primes" was not available to him as the Greeks did not have the concept of "infinite".
The largest prime factor of 42 is 7
The largest prime number less than 1000 is 997.The largest prime number no less than 1000 is currently 257,885,161-1
The largest known prime number is 243112609 - 1, the largest integer that is currently known to be a prime number. It was proven by Euclid that there are infinitely many prime numbers; thus, there is always a prime greater than the largest known prime.
Euclid proved that it is impossible to find the "largest prime number," because if you take the largest known prime number, add 1 to the product of all the primes up to and including it, you will get another prime number. Euclid's proof for this theorem is generally accepted as one of the "classic" proofs because of its conciseness and clarity. Millions of prime numbers are known to exist, and more are being added by mathematicians and computer scientists. Mathematicians since Euclid have attempted without success to find a pattern to the sequence of prime numbers.
Please note that there cannot be a largest prime number; Euclid proved that about 2000 years ago. As to the largest known prime number, according to the Wikipedia, as of January 2014, the largest known prime number is 2 to the power 57,885,161 − 1, a number with 17,425,170 digits. This number was found to be a prime in January 2013.
euclid wanted to prove that things were true by using logic and reason.
Euclid wanted to prove things were true by using logic and reasoning.
Euclid (c. 300 BC) was one of the first to prove that there are infinitely many prime numbers. His proof was essentially to assume that there were a finite number of prime numbers, and arrive at a contradiction. Thus, there must be infinitely many prime numbers. Specifically, he supposed that if there were a finite number of prime numbers, then if one were to multiply all those prime numbers together and add 1, it would result in a number that was not divisible by any of the (finite number of) prime numbers, thus would itself be a prime number larger than the largest prime number in the assumed list - a contradiction.
No one invented prime numbers.
Euclid
Euclid
The Egyptians were the first people to have some knowledge in prime numbers. Though, the earliest known record are Euclid's Elements, which contain the important theorem of prime numbers. The Ancient Greeks, including Euclid, were the first people to find prime numbers. Euclid constructed the Mersenne prime to work out the infinite number of primes.
Euclid
This is an unsolved problem in mathematics. However, as of 2012, the prime 41 had not been known to appear in the Euclid-Mullin sequence.