Now lets define the number x = p1*p2*p3*p4*...*pL + 1.
What it means to be prime is that no other smaller prime divides into it evenly.
If we divide p1, p2, p3, ... pL into x we get a remainder of 1 every time.
You might argue that maybe a prime bigger than pL divides into x evenly. Yes, but then you would have found a larger prime than the so-called largest prime. If not, then x because a new largest prime, proving the initial conjecture of the existence of a largest prime by contradiction.
If one picks a number it has to be proven as prime to validate the theory.
So the search for primes that is "the largest prime" is also infinite.
Its best to say the question, "What is the largest prime number?" remains unresolved: not that it does not exist.
Since numbers are infinite,there is NO maximum or end to it. It is not unresolved, the largest prime number does not exist at all cause numbers are infinite.
First, some notation. We say "a divides b" if you can divide b by a and get no remainder. So, for example, 2 divides 6 but 2 does not divide 11.
Now, for some number p that is larger than 1, if p divides x, then p does not divide x + 1. For example, 3 divides 6 but 3 does not divide 7. The next number after 6 which is divisible by 3 is 6+3=9.
So, we are going to do a proof by contradiction. That is, we are going to assume that there are only finitely many primes, and then show that this leads to a contradiction, so our initial assumption must have been wrong.
Assume that there are only finitely many primes. Multiply them all together; you get a number. We will call that number x. All of the primes divide x. That means that none of the primes divide x+1. This is a contradiction (all numbers have a prime factorization). So our initial assumption (that there are only finitely many primes) must have been incorrect. Therefore, there are infinitely many primes.
That's it. If you still find this too advanced, maybe the problem is that it's difficult to jump right into something without first having the background. You have to walk before you can run, as the saying goes. Perhaps you should pick up an entry-level college textbook on Abstract Algebra or Classical Algebra (look for something with one of these two things in the title). It will take you through the introduction of really basic number theory, modular arithmetic, etc, and this will be a result that should be proven relatively early on. (Note that there are other ways to prove it, but this is by far the simplest way). This is actually a really interesting field of mathematics, so hopefully you will enjoy it.
Thanks everyone for your responses. I'm still in the dark. An example of the equation might help. 2x 3 x 5 x7 plus one is a prime, 211, but if you continue with the calculation and multiply 210 x 9 plus 1 you get 1,891 which is not a prime. If someone could write out the calculation that when added to 1 is always a prime, that would be great!
First: 9 is not prime. You probably wanted 11.
Second: there is no known solution to what you're asking for. You just have to calculate it, and check for primality. In general, finding large primes is computationally difficult! There is no easy way to generate them.
If you find this interesting, you might also want to look at Mersenne numbers, which are of the form 2^n - 1. http://en.wikipedia.org/wiki/Mersenne_prime
Note that this is unrelated to the proof that there are infinitely many primes.
Wizard's proof is valid. But it doesn't say that you can use the formula if pL is not the "largest" prime.
(or in other words, the formula makes sense only if you multiply ALL prime numbers together.)