The sequence { x n } is defined by x 1 = 2 1 and x k + 1 = x k 2 + x k for k ≥ 2 . Find the greatest integer less than x 1 + 1 1 + x 2 + 1 1 + x 3 + 1 1 + ⋯ + x 1 0 0 + 1 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.
We will use the recurrence relation of the sequence to telecope the sum. Since x k + 1 = x k 2 + x k , we obtain x k + 1 1 = x k ( x k + 1 ) 1 = x k 1 − x k + 1 1 ⇒ x k + 1 1 = x k 1 − x k + 1 1 ⇒ x 1 + 1 1 + x 2 + 1 1 + ⋯ + x 1 0 0 + 1 1 = x 1 1 − x 1 0 1 1 Since x 1 1 = 2 and 0 < x 1 0 1 1 < 1 , the integer part of the sum is 1 .
Problem Loading...
Note Loading...
Set Loading...
Similar solution with @Anish Roy 's
x k + 1 1 ⟹ x k + 1 1 k = 1 ∑ n x k + 1 1 = x k 2 + x k 1 = x k ( x k + 1 ) 1 = x k 1 − x k + 1 1 = x k 1 − x k + 1 1 = k = 1 ∑ n x k 1 − k = 1 ∑ n x k + 1 1 = x 1 1 − x n + 1 1 = 2 − x n + 1 1 < 2 Note that k = 1 ∑ n x k + 1 1 = x 1 + 1 1 + x 2 + 1 1 + x 3 + 1 1 + ⋯ + x n + 1 1
⟹ ⌊ k = 1 ∑ n x k + 1 1 ⌋ = 1