Question: Pierre de Fermat (16011665) conjectured that the function f(x) = 2(2) + 1
![]()
for x = 1, 2, 3, ... , would always have a value equal to a prime number. But Leonhard Euler (1707-1783) showed that this formula fails for x = 5. Use a calculator to determine the prime numbers produced by f for x = 1, 2, 3, 4. Then show that f(S) = 641 Ã 6,700,417, which is not prime.
f(x) = 2(2") + 1
Step by Step Solution
3.25 Rating (166 Votes )
There are 3 Steps involved in it
x 2 2 1 1 1 2 1 2 1 415 2 ... View full answer
Get step-by-step solutions from verified subject matter experts
