a n + 1 = 2 + a n
Consider the recurrence relation a n above for n = 1 , 2 , 3 , … and a 1 = 3 .
Evaluate lo g 2 [ cos − 1 ( 2 a 2 0 1 6 ) ] .
If this number can be expressed as lo g 2 π − lo g 2 a − b , where a and b are positive integers with a odd, submit your answer as a + 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.
You need to additionally argue that ∣ 2 a n ∣ ≤ 1 , for the substitution cos θ n = a n / 2 to make sense.
Log in to reply
Thanks, I have done the changes.
Log in to reply
Regarding the bit about showing ∣ ∣ 2 a n ∣ ∣ < 1 , we could just note that a n + 1 / 2 = 1 / 2 + a n / 4 , so that ∣ a n / 2 ∣ < 1 would imply ∣ a n + 1 / 2 ∣ < 1 . Then, noting a 1 / 2 < 1 , induction would establish the claim.
Log in to reply
@Samrat Mukhopadhyay – Thanks. I thought a n + 1 / 2 = 1 + a n / 2 , stupid me.
What made you think of rewriting a n + 1 2 = 2 + a n as 2 a n = 2 a n + 1 2 − 1 ? Very elegant solution!
Log in to reply
We can't proceed much with square root around.
It is most likely to be motivated by the cosine double-angle formula, which in turn is hinted since the question asks for an inverse cosine expression. Trigonometric substitutions are always hiding around!
Problem Loading...
Note Loading...
Set Loading...
It is given that:
a n + 1 a n + 1 2 ⟹ 2 a n = 2 + a n = 2 + a n = 2 a n + 1 2 − 1
We note that 2 a n + 1 = 4 2 + a n , as 2 a 1 < 1 , then 2 a n < 1 for all n and we can let cos θ = 2 a n + 1 .
cos θ n ⟹ θ n θ n + 1 θ 2 θ 3 θ 4 ⋯ ⟹ θ n = 2 cos 2 θ n + 1 − 1 = 2 θ n + 1 = 2 θ n = 2 θ 1 = 6 ⋅ 2 π = 3 ⋅ 2 3 π = 3 ⋅ 2 4 π = ⋯ = 3 ⋅ 2 n π As cos θ 1 = 2 a 1 = 2 3 ⟹ θ 1 = 6 π
Therefore, we have:
lo g 2 ( cos − 1 ( 2 a 2 0 1 6 ) ) = lo g 2 ( θ 2 0 1 6 ) = lo g 2 ( 3 ⋅ 2 2 0 1 6 π ) = lo g 2 π − lo g 2 3 − 2 0 1 6
⟹ a + b = 3 + 2 0 1 6 = 2 0 1 9