Maths Olympiad Prep

Track / Stage 6 / 54 of 400 #1054 of 1964

Problem 1054

National olympiad, first round
Number theory Difficulty 6.0 Prove it

Example 7 Prove: (2sinπ7)2n+(2sin2π7)2n+(2sin3π7)2n\left(2 \sin \frac{\pi}{7}\right)^{2 n}+\left(2 \sin \frac{2 \pi}{7}\right)^{2 n}+\left(2 \sin \frac{3 \pi}{7}\right)^{2 n} is divisible by 7[π3]7^{\left[\frac{\pi}{3}\right]}. Here [x][x] denotes the greatest integer not exceeding xx.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

Analysis First, construct the polynomial f(x)=(xx1)(xx2)(xx3)f(x)=\left(x-x_{1}\right)(x-x_{2})\left(x-x_{3}\right) with roots xk=(2sinkπ7)2(k=1,2,3)x_{k}=\left(2 \sin \frac{k \pi}{7}\right)^{2}(k=1,2,3). Let Sn=x1n+x2n+x3nS_{n}=x_{1}^{n}+x_{2}^{n}+x_{3}^{n}, and use Newton's formulas to establish a recurrence relation for TnT_{n}. Then, complete the proof using mathematical induction.

Proof Let xk=(2sinkπ7)2,k=1,2,3x_{k}=\left(2 \sin \frac{k \pi}{7}\right)^{2}, k=1,2,3. Construct the polynomial
f(x)=(xx1)(xx2)(xx3)=x3σ1x2+σ2xσ3, f(x)=\left(x-x_{1}\right)\left(x-x_{2}\right)\left(x-x_{3}\right)=x^{3}-\sigma_{1} x^{2}+\sigma_{2} x-\sigma_{3},

where σ1=x1+x2+x3=k=13(2sinkπ7)2=k=132(1cos2kπ7)\sigma_{1}=x_{1}+x_{2}+x_{3}=\sum_{k=1}^{3}\left(2 \sin \frac{k \pi}{7}\right)^{2}=\sum_{k=1}^{3} 2\left(1-\cos \frac{2 k \pi}{7}\right)
=62k=13cos2kπ7=61sinπ7k=132coskπ7sinπ7=61sinπ7k=13[sin(2k+1)π7sin(2k1)π7]=61sinπ7(sinπsinπ7)=7, \begin{array}{l} =6-2 \sum_{k=1}^{3} \cos \frac{2 k \pi}{7}=6-\frac{1}{\sin \frac{\pi}{7}} \sum_{k=1}^{3} 2 \cos \frac{k \pi}{7} \sin \frac{\pi}{7} \\ =6-\frac{1}{\sin \frac{\pi}{7}} \sum_{k=1}^{3}\left[\sin \frac{(2 k+1) \pi}{7}-\sin \frac{(2 k-1) \pi}{7}\right] \\ =6-\frac{1}{\sin \frac{\pi}{7}}\left(\sin \pi-\sin \frac{\pi}{7}\right)=7, \end{array}

Similarly, we can obtain σ2=x1x2+x2x3+x3x1=14,σ3=x1x2x3=7\sigma_{2}=x_{1} x_{2}+x_{2} x_{3}+x_{3} x_{1}=14, \sigma_{3}=x_{1} x_{2} x_{3}=7.
Let Sn=x1n+x2n+x3n,nNS_{n}=x_{1}^{n}+x_{2}^{n}+x_{3}^{n}, n \in \mathbf{N}. We need to prove that 7[n3]Sn\left.7^{\left[\frac{n}{3}\right]} \right\rvert\, S_{n}, and according to Newton's formulas, we have
Sn=σ1Sn1σ2Sn2+σ3Sn3=7Sn114Sn2+7Sn3, and S0=3,S1=7,S2=21 S_{n}=\sigma_{1} S_{n-1}-\sigma_{2} S_{n-2}+\sigma_{3} S_{n-3}=7 S_{n-1}-14 S_{n-2}+7 S_{n-3} \text {, and } S_{0}=3, S_{1}=7, S_{2}=21 \text {. }

We will use mathematical induction to prove that SnS_{n} is divisible by 7[n3]7^{\left[\frac{n}{3}\right]}.
When n=0,1,2n=0,1,2, the conclusion is obviously true. Assume that for nkn \leqslant k, SnS_{n} is divisible by 7[n3]7^{\left[\frac{n}{3}\right]}. When n=k+1n=k+1, by Sk+1=7(Sk2Sk1+Sk2)S_{k+1}=7\left(S_{k}-2 S_{k-1}+S_{k-2}\right), we know that Sk+1S_{k+1} is divisible by 71+[k23]7^{1+\left[\frac{k-2}{3}\right]}. Since 1+[k23]=[k+13]1+\left[\frac{k-2}{3}\right]=\left[\frac{k+1}{3}\right], Sk+1S_{k+1} is divisible by 7[k+13]7^{\left[\frac{k+1}{3}\right]}. Therefore, SnS_{n} is divisible by 7[n3]7^{\left[\frac{n}{3}\right]}. Proof completed.

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