Let F n denote the n th Fermat number, F n = 2 2 n + 1 . Find n = 0 ∏ ∞ ( 1 − F n 1 ) .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
you're right,Fermat numbers get really big,real fast
Log in to reply
See induction proof
Log in to reply
you're really good at doing solutions with a few lines :)
Log in to reply
@Hamza A – Let me let on a secret. First, I use up pages and pages in working out a problem and then the solution, and then I make it as short as possible because it's so much trouble to write it out in LaTex. By the time I'm through, everybody thinks I must be a genius.
Log in to reply
@Michael Mendrin – Lol,you really are though :)
Log in to reply
@Hamza A – It was Thomas Edison that said that genius is 1% inspiration and 99% perspiration. Or something like that.
Log in to reply
@Michael Mendrin – yeah,except most of his patents were stolen :(,he was good at business ,not inventing
Problem Loading...
Note Loading...
Set Loading...
This converges EXTREMELY fast. After just 7 terms, it's 0 . 5 followed by 3 7 zeroes.
Edit: But we can see how this works inductively
( 2 ( 2 2 n − 1 ) 2 2 n ) ( 1 − 2 2 n + 1 1 ) = ( 2 ( 2 2 n + 1 − 1 ) 2 2 n + 1 )
so we can see that the limit value is just 2 1