A B C D Z = = = = ⋮ = 2 0 0 0 A − 9 9 9 A + B − 9 9 8 A + B + C − 9 9 7 A + B + C + . . . + Y − 9 7 5
How much is 2 2 5 Z + 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.
I'm setting B = x 0 = 1 0 0 1 , C = x 1 = 2 0 0 3 , . . . , Z = x 2 4 . We have the recursive formula x n = 2 x n − 1 + 1 , or, x n + 1 = 2 ( x n − 1 + 1 ) , so that x n + 1 = 2 n ( x 0 + 1 ) = 1 0 0 2 ( 2 n ) . Thus 2 2 5 z + 1 = 2 2 5 x 2 4 + 1 = 2 2 5 1 0 0 2 ( 2 2 4 ) = 5 0 1
How you know that 2(xsubn-1+1) is equal to 2n(xsub0+1)?
Log in to reply
I'm applying the formula x n + 1 = 2 ( x n − 1 + 1 ) over and over again: x n + 1 = 2 ( x n − 1 + 1 ) = 4 ( x n − 2 + 1 ) + . . . More formally, I'm using induction.
Noted 2 2 5 Z + 1 = 2 2 5 2 Y + 1 + 1 = 2 2 4 Y + 1
so 2 2 5 Z + 1 = 2 2 4 Y + 1 = 2 2 3 X + 1 = .... = 2 2 C + 1 = 2 1 B + 1 = 2 A − 9 9 9 + 1 = 501
Problem Loading...
Note Loading...
Set Loading...
F i r s t , I g o t t h a t B = 1 0 0 1 . A n d w e c a n s e e t h a t C = 2 B + 1 ⇒ 2 B + ( 2 − 1 ) D = 2 C + 1 = 4 B + 3 ⇒ 2 2 B + ( 2 2 − 1 ) E = 2 D + 1 = 8 B + 7 ⇒ 2 3 B + ( 2 3 − 1 ) F = 2 E + 1 = 1 6 B + 1 5 ⇒ 2 4 B + ( 2 4 − 1 ) . . . Z = 2 Y + 1 ⇒ 2 2 4 B + ( 2 2 4 − 1 ) N o w , 2 2 5 Z + 1 = 2 2 5 [ 2 2 4 ( B + 1 ) − 1 ] + 1 = 2 B + 1 = 5 0 1 .