Consider 2 7 = a 0 + a 1 + a 2 + . . . 1 1 1 , with a i are positive integers. Sequence a 1 , a 2 , . . . are repeated each k -part, i.e a i = a i + k , for each i = 1 , 2 , 3 , . . . . Find the value of a 0 + a 1 + a 2 + . . . + a k
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.
Problem Loading...
Note Loading...
Set Loading...
The closest perfect square less than 2 7 is 2 5 , so we know that a 0 will be 5 . Let 2 7 = 5 + x . Then
5 + x 2 5 + 1 0 x + x 2 x ( 1 0 + x ) x = 2 7 = 2 7 = 2 = 1 0 + x 2
Now we have an expression for x , which we can use to replace the x in itself, i.e.
x = 1 0 + 1 0 + x 2 2
We could continue this indefinitely and get a continued fraction representation for 2 7 , but we want the numerators of our continued fraction to be 1 's rather than 2 's. Luckily, we notice that in the above expression, the numerator, the first term in the denominator and the fraction in the denominator can all be divided by 2 . Then
x = 1 0 + 1 0 + x 2 2 = 2 1 0 + 1 0 + x 2 2 2 2 = 5 + 1 0 + x 1 1
Now we can substitute the entire expression on the right into x , getting
x = 5 + 1 0 + x 1 1 = 5 + 1 0 + 5 + 1 0 + x 1 1 1 1 = 5 + 1 0 + 5 + 1 0 + 5 + 1 0 + … 1 1 1 1 1 1
and so
2 7 = 5 + x = 5 + 5 + 1 0 + 5 + 1 0 + … 1 1 1 1
so we have a 0 = 5 , a 1 = 5 and a 2 = 1 0 , giving the answer a 0 + a 1 + a 2 = 2 0