n = 1 ∑ ∞ 1 0 0 n F n = 0 . 0 1 0 1 0 2 0 3 0 5 0 8 1 3 2 1 3 4 5 5 . . . = b a
where F n is the Fibonacci sequence and g cd ( a , b ) = 1 . Find b .
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.
This looks fishy. Are you saying that all Fibonacci numbers are 2-digit integers, so there's no carry over from the expression 1 0 0 S − S ?
Log in to reply
2-digit, carry over, those are not relevant.
the solution presented is still valid, but not rigorous.
there's a rigorous way, here's a hint if u wanna try: let (1/100) = x
S = 1x + 1x^2 + 2x^3 + 3x^4+ 5x^5 + 8x^6 + ...
Problem Loading...
Note Loading...
Set Loading...
1 0 0 S S 9 9 S 9 9 0 0 S S 9 8 9 9 S S ∴ b = 1 . 0 1 0 2 0 3 0 5 0 8 1 3 2 1 . . . = 0 . 0 1 0 1 0 2 0 3 0 5 0 8 1 3 . . . = 1 . 0 0 0 1 0 1 0 2 0 3 0 5 0 8 . . . = 1 0 0 . 0 1 0 1 0 2 0 3 0 5 0 8 1 3 . . . = 0 . 0 1 0 1 0 2 0 3 0 5 0 8 1 3 . . . = 1 0 0 . 0 0 0 0 0 0 0 0 0 0 0 0 0 0 = 9 8 9 9 1 0 0 = 9 8 9 9