so I stumbled upon this equation/formula, and I have no idea how to prove it. I don't know how should I approach it:
√2+√2+⋯+√2+√A2 = 2cos(Aπ2n+1)
where n∈N and the square root sign appears n-times.
I thought about using sequences and limits, to express the LHS as a recurrence relation but I didn't get anywhere.
edit: Solved, thanks for your answers and comments.
Answer
Hint:
Use induction and the half-angle formula for cosine.
Solution:
For n=1, the claim is true, since cos(π/4)=√2/2. By the half-angle formula 2cos(x/2)=√2+2cos(x)
Therefore
√2+√2+⋯+√2+√2=√2+2cos(π2n)=2cos(π2n+1)
where in the left square root expressions there are n square roots and in the first equality we have used the induction hypothesis that the claim holds for n−1.
No comments:
Post a Comment