Ask your own question, for FREE!
Mathematics 23 Online
OpenStudy (anonymous):

The French mathematician Pierre de Fermat (1601-1665) considered the sequence 5, 17, 257, 65537, ... , 2^(2^n) + 1, ... He observed that the first four terms of the sequence (here given) corresponding to n = 1, 2, 3, 4, are primes. (A prime number is a natural number other than one divisible only by itself and one. A natural number is divisible by another natural number if the ratio of numbers is itself a natural number.) He conjectured that the following terms were also primes and, being confident his induction was correct, challenged the prominent English mathematicians of the day to prove his conjecture. (Fermat was unable to do so himself.) Discuss the validity of the conjecture and the efforts placed in proving or disproving this conjecture.

OpenStudy (anonymous):

\[2^{2^{5}}+1\] Sadly, Fermat's time period did not allow such a calculation.

OpenStudy (anonymous):

\(2^{2^6}+1\) is also not prime.

OpenStudy (kinggeorge):

So far only the first 4 terms that Fermat calculated are prime.

OpenStudy (anonymous):

@KingGeorge, I kept remembering there was some really fatal irony here... Now I know what that fatal irony was.

OpenStudy (phi):

less than 100 years later, Euler found a counter-example. (so not much time spent on this problem as compared to his "Last Theorem" According to http://www.sciencenews.org/view/generic/id/3615/title/Math_Trek__Cracking_Fermat_Numbers people have spent their time looking for divisors of these numbers.

OpenStudy (kinggeorge):

However, there are still many interesting properties to these numbers. Such as if \(m\neq n\) are two positive integers, then \[\large 2^{2^m}+1\]and \[\large 2^{2^n}+1\]share no common divisors.

OpenStudy (anonymous):

Alrighty, Thanks guys :))))))) All use all this info to create my discussion post Thanks :)))))))

OpenStudy (anonymous):

You're welcome, Sam! Goodluck.

OpenStudy (anonymous):

Y cant i give all of u guys medals. NO FAIR :(

OpenStudy (anonymous):

Here's a solution: Give me a medal. I'll give KG a medal. KG will give Phi a medal. WE ALL WIN!

OpenStudy (anonymous):

hahah i was thinking abt that lol

OpenStudy (anonymous):

(I'm being serious.)

OpenStudy (anonymous):

Any objections, @Phi and @KingGeorge ?

OpenStudy (anonymous):

kinnnnnggggg medal limitless lol

OpenStudy (kinggeorge):

I've got no objections

OpenStudy (anonymous):

and limitless medal phi

OpenStudy (anonymous):

Works

OpenStudy (kinggeorge):

oh wait, what's the plan?

OpenStudy (anonymous):

and then we r set to go :)

OpenStudy (anonymous):

KG, medal me. Then I'll medal Phi.

OpenStudy (anonymous):

SUCCESS

OpenStudy (kinggeorge):

Chrome lion approves.

OpenStudy (anonymous):

YAY it worked :D

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!