Maths Olympiad Prep

Library / /513 of 520

Number theory Difficulty 6.2 National olympiad Prove it

Prove: For any nN+,(2+1)nn \in \mathbf{N}_{+}, (\sqrt{2}+1)^{n} can be written in the form m+m1(mN+)\sqrt{m}+\sqrt{m-1}\left(m \in \mathbf{N}_{+}\right). Find the analytical expression of mm in terms of nn.

Solution

The simplest method is to consider the dual form of (2+1)n(\sqrt{2}+1)^{n}, which is (21)n(\sqrt{2}-1)^{n}.
By the binomial theorem, we have
(2+1)n=a+b(21)n=ab(a,bN+)(ab)(a+b)=(21)n(2+1)n=1a=m,b=m1. \begin{array}{l} (\sqrt{2}+1)^{n}=\sqrt{a}+\sqrt{b} \\ \Rightarrow(\sqrt{2}-1)^{n}=\sqrt{a}-\sqrt{b}\left(a, b \in \mathbf{N}_{+}\right) \\ \Rightarrow(\sqrt{a}-\sqrt{b})(\sqrt{a}+\sqrt{b}) \\ =(\sqrt{2}-1)^{n}(\sqrt{2}+1)^{n}=1 \\ \Rightarrow a=m, b=m-1 . \end{array}

Proof:
(1) When n=1,m=2n=1, m=2, it is clearly true.
(2) Assume that when n=kn=k,
(2+1)k=m+m1 (\sqrt{2}+1)^{k}=\sqrt{m}+\sqrt{m-1} \text {. }

Then when n=k+1n=k+1,
(2+1)k+1=(2+1)k(2+1)=(m+m1)(2+1)=(m+2m2)+(2m+m1)=3m2+22m(m1)+3m1+22m(m1). \begin{array}{l} (\sqrt{2}+1)^{k+1}=(\sqrt{2}+1)^{k}(\sqrt{2}+1) \\ =(\sqrt{m}+\sqrt{m-1})(\sqrt{2}+1) \\ =(\sqrt{m}+\sqrt{2 m-2})+(\sqrt{2 m}+\sqrt{m-1}) \\ =\sqrt{3 m-2+2 \sqrt{2 m(m-1)}}+ \\ \quad \sqrt{3 m-1+2 \sqrt{2 m(m-1)}} . \end{array}

Next, we need to prove that 2m(m1)N+\sqrt{2 m(m-1)} \in \mathbf{N}_{+}.
By the binomial theorem, we have
(2+1)k=a+b2(a,bN+) (\sqrt{2}+1)^{k}=a+b \sqrt{2}\left(a, b \in \mathbf{N}_{+}\right) \text {. }

Also,
a+b2=m+m1, a+b \sqrt{2}=\sqrt{m}+\sqrt{m-1},

so, one of mm and m1m-1 is a perfect square, and the other is twice a perfect square.
Therefore, 2m(m1)2 m(m-1) is a perfect square, i.e., 2m(m1)N+\sqrt{2 m(m-1)} \in \mathbf{N}_{+}.
Thus, when n=k+1n=k+1, the conclusion holds.
Combining (1) and (2), the conclusion is established.
From the above solution process, we see that mm is a sequence of numbers determined by nn. If we set each mm corresponding value to ana_{n}, then what is the general term formula of {an}\left\{a_{n}\right\}?

It is not difficult to find that when nn changes from kk to k+1k+1, mm changes to 3m1+22m(m1)3 m-1+2 \sqrt{2 m(m-1)}.
Thus, we have the nonlinear recurrence relation
an+1=3an1+22an(an1)(a1=2). a_{n+1}=3 a_{n}-1+2 \sqrt{2 a_{n}\left(a_{n}-1\right)}\left(a_{1}=2\right) .

This recurrence relation can be transformed into a linear relation through the following operations.
 By an+1=3an1+22an(an1)(an+13an+1)2=4×2an(an1)an+12+an2+2an+1+2an6an+1an+1=0an12+an2+2an1+2an6anan1+1=0(n2) \begin{array}{l} \text { By } a_{n+1}=3 a_{n}-1+2 \sqrt{2 a_{n}\left(a_{n}-1\right)} \\ \Rightarrow\left(a_{n+1}-3 a_{n}+1\right)^{2}=4 \times 2 a_{n}\left(a_{n}-1\right) \\ \Rightarrow a_{n+1}^{2}+a_{n}^{2}+2 a_{n+1}+2 a_{n}-6 a_{n+1} a_{n}+1=0 \\ \Rightarrow a_{n-1}^{2}+a_{n}^{2}+2 a_{n-1}+2 a_{n}-6 a_{n} a_{n-1}+1 \\ \quad=0(n \geqslant 2) \text {. } \end{array}

Comparing equations (1) and (2), we know that an1a_{n-1} and an+1a_{n+1} are the two roots of the equation
x2+(26an)x+an2+2an+1=0 x^{2}+\left(2-6 a_{n}\right) x+a_{n}^{2}+2 a_{n}+1=0

Thus, an+1+an1=6an2a_{n+1}+a_{n-1}=6 a_{n}-2.
Rearranging, we get
an+112=6(an12)(an112)a_{n+1}-\frac{1}{2}=6\left(a_{n}-\frac{1}{2}\right)-\left(a_{n-1}-\frac{1}{2}\right).
Let bn=an12b_{n}=a_{n}-\frac{1}{2}.
Then bn+1=6bnbn1b_{n+1}=6 b_{n}-b_{n-1}, where b1=32,b2=172b_{1}=\frac{3}{2}, b_{2}=\frac{17}{2}.
The characteristic equation is x2=6x1x^{2}=6 x-1.
Solving, we get x=3±22x=3 \pm 2 \sqrt{2}.
Thus, bn=A(3+22)n+B(322)nb_{n}=A(3+2 \sqrt{2})^{n}+B(3-2 \sqrt{2})^{n}.
Substituting b1b_{1} and b2b_{2}, we get A=B=14A=B=\frac{1}{4}.
Therefore, an=14(3+22)n+14(322)n+12a_{n}=\frac{1}{4}(3+2 \sqrt{2})^{n}+\frac{1}{4}(3-2 \sqrt{2})^{n}+\frac{1}{2}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.