Other Free Encyclopedias » Science Encyclopedia » Science & Philosophy: Nicotinamide adenine dinucleotide phosphate (NADP) to Ockham's razor » Number Theory - Prime And Composite Numbers, Fermat's Theorem, Gauss And Congruence, Fermat's Failed Prime Number Formula - Famous formulas in number theory, Famous problems in number theory

Number Theory - Fermat's Failed Prime Number Formula


Many mathematicians, including Mersenne and Euler, have tried to find a formula that will define all the prime numbers. No one has ever succeeded.

Fermat had one of the most famous failures. He thought that if he squared 2 and then raised the square of 2 to a higher power, which he labeled n (a whole number), then the results would be nothing but primes. His formula looks like this: 2n 2 + 1 = a prime number. This formula appeared to work until Leonhard Euler proved it wrong. Euler found that if 5 is substituted for n in the formula 22n + 1, the resulting number is 4,294,967,297, which can be divided equally by 641 and 6,700,417.

Number Theory - Fermat's Last Theorem [next] [back] Number Theory - Gauss And Congruence

User Comments

Your email address will be altered so spam harvesting bots can't read it easily.
Hide my email completely instead?

Cancel or