Let and for . Compute:
If your answer comes in form of where and are coprime positive integers, then enter as your answer.
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 is proved by induction on k .
This is proved by induction on K .
Note that a k + 1 + 1 = a k 2 − 1 = ( a k − 1 ) ( a k + 1 ) , and hence that a k − 1 = a k + 1 a k + 1 + 1 for all k ≥ 0 , so that k = 0 ∏ K ( a k − 1 ) = a 0 + 1 a K + 1 + 1 = 7 2 ( 2 2 K + 1 + 1 + 2 − 2 K + 1 ) for all K ≥ 0
Putting this all together, we see that k = 0 ∏ K ( 1 − a k 1 ) = k = 0 ∏ K a k k = 0 ∏ K ( a k − 1 ) = 7 3 × 2 2 K + 1 − 2 − 2 K + 1 2 2 K + 1 + 1 + 2 − 2 K + 1 and hence, letting K → ∞ , k = 0 ∏ ∞ ( 1 − a k 1 ) = 7 3 making the answer 3 + 7 = 1 0 .