Logo
Published on

Nested Radicals and a Cosine Formula

Authors
  • avatar
    Name
    Vu Hung
    Twitter

Problem Statement

The numbers ana_n, for integers n1n \geq 1, are defined as:

a1=2a2=2+2a3=2+2+2, and so on.\begin{aligned} a_1 &= \sqrt{2} \\ a_2 &= \sqrt{2 + \sqrt{2}} \\ a_3 &= \sqrt{2 + \sqrt{2 + \sqrt{2}}}, \text{ and so on.} \end{aligned}

These numbers satisfy the relation an+12=2+ana_{n+1}^2 = 2 + a_n, for n1n \geq 1. (Do NOT prove this.)

Use mathematical induction to prove that an=2cos(π2n+1)a_n = 2\cos\left(\frac{\pi}{2^{n+1}}\right) for all integers n1n \geq 1.


Hints

Attempt the proof independently first. Focus on the key theorem, algebraic transformation, or contradiction setup that links the hypothesis to the target conclusion.


Solutions

Proof by Mathematical Induction

Base Case (n=1n=1):

LHS: a1=2a_1 = \sqrt{2} (given)

RHS: 2cos(π21+1)=2cos(π4)=222=22\cos\left(\frac{\pi}{2^{1+1}}\right) = 2\cos\left(\frac{\pi}{4}\right) = 2 \cdot \frac{\sqrt{2}}{2} = \sqrt{2}

Since LHS = RHS, the statement holds for n=1n=1. \checkmark

Inductive Hypothesis:

Assume the statement is true for n=kn=k, where kk is a positive integer:

ak=2cos(π2k+1)a_k = 2\cos\left(\frac{\pi}{2^{k+1}}\right)

Inductive Step:

We must prove the statement for n=k+1n=k+1:

ak+1=2cos(π2k+2)a_{k+1} = 2\cos\left(\frac{\pi}{2^{k+2}}\right)

Using the recurrence relation ak+12=2+aka_{k+1}^2 = 2 + a_k and the inductive hypothesis:

ak+12=2+2cos(π2k+1)=2[1+cos(π2k+1)]\begin{aligned} a_{k+1}^2 &= 2 + 2\cos\left(\frac{\pi}{2^{k+1}}\right) \\ &= 2\left[1 + \cos\left(\frac{\pi}{2^{k+1}}\right)\right] \end{aligned}

Apply the double angle identity: 1+cos(2θ)=2cos2(θ)1 + \cos(2\theta) = 2\cos^2(\theta).

Let 2θ=π2k+12\theta = \frac{\pi}{2^{k+1}}, so θ=π2k+2\theta = \frac{\pi}{2^{k+2}}:

ak+12=22cos2(π2k+2)=4cos2(π2k+2)\begin{aligned} a_{k+1}^2 &= 2 \cdot 2\cos^2\left(\frac{\pi}{2^{k+2}}\right) \\ &= 4\cos^2\left(\frac{\pi}{2^{k+2}}\right) \end{aligned}

Taking square roots:

ak+1=±2cos(π2k+2)a_{k+1} = \pm 2\cos\left(\frac{\pi}{2^{k+2}}\right)

Since n1n \geq 1, we have 0<π2k+2<π20 < \frac{\pi}{2^{k+2}} < \frac{\pi}{2}, so cos(π2k+2)>0\cos\left(\frac{\pi}{2^{k+2}}\right) > 0.

Also, ana_n is defined as nested square roots of positive numbers, so ak+1>0a_{k+1} > 0.

Therefore:

ak+1=2cos(π2k+2)a_{k+1} = 2\cos\left(\frac{\pi}{2^{k+2}}\right)

This completes the inductive step. \checkmark

Conclusion:

By mathematical induction, an=2cos(π2n+1)a_n = 2\cos\left(\frac{\pi}{2^{n+1}}\right) for all integers n1n \geq 1.

\hfill \square


Takeaways

  • Induction with Recurrence: Use given recurrence relation in inductive step to relate ak+1a_{k+1} to aka_k
  • Double Angle Formula: Identity 1+cos(2θ)=2cos2(θ)1 + \cos(2\theta) = 2\cos^2(\theta) is key to converting sum to square
  • Sign Consideration: Must justify taking positive square root using domain/range analysis
  • Angle Halving: Pattern shows ana_n relates to cos\cos of successively halved angles (π/4,π/8,π/16,\pi/4, \pi/8, \pi/16, \ldots)

Further Readings

If you found this proof interesting, be sure to check out these relevant HSC booklets to sharpen your reasoning skills:


Connect with me

If you're eager for more HSC Maths insights, be sure to check out my Substack. For deeper dives and regular tips, join my Website - Vu's Maths Hub. Let's tackle these challenging math problems together! You can also catch my daily math content on GitHub.