Example 7 Prove: (2sin7π)2n+(2sin72π)2n+(2sin73π)2n is divisible by 7[3π]. Here [x] denotes the greatest integer not exceeding x.
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)=(x−x1)(x−x2)(x−x3) with roots xk=(2sin7kπ)2(k=1,2,3). Let Sn=x1n+x2n+x3n, and use Newton's formulas to establish a recurrence relation for Tn. Then, complete the proof using mathematical induction.
Proof Let xk=(2sin7kπ)2,k=1,2,3. Construct the polynomial f(x)=(x−x1)(x−x2)(x−x3)=x3−σ1x2+σ2x−σ3,
where σ1=x1+x2+x3=∑k=13(2sin7kπ)2=∑k=132(1−cos72kπ) =6−2∑k=13cos72kπ=6−sin7π1∑k=132cos7kπsin7π=6−sin7π1∑k=13[sin7(2k+1)π−sin7(2k−1)π]=6−sin7π1(sinπ−sin7π)=7,
Similarly, we can obtain σ2=x1x2+x2x3+x3x1=14,σ3=x1x2x3=7. Let Sn=x1n+x2n+x3n,n∈N. We need to prove that 7[3n]Sn, and according to Newton's formulas, we have Sn=σ1Sn−1−σ2Sn−2+σ3Sn−3=7Sn−1−14Sn−2+7Sn−3, and S0=3,S1=7,S2=21.
We will use mathematical induction to prove that Sn is divisible by 7[3n]. When n=0,1,2, the conclusion is obviously true. Assume that for n⩽k, Sn is divisible by 7[3n]. When n=k+1, by Sk+1=7(Sk−2Sk−1+Sk−2), we know that Sk+1 is divisible by 71+[3k−2]. Since 1+[3k−2]=[3k+1], Sk+1 is divisible by 7[3k+1]. Therefore, Sn is divisible by 7[3n]. Proof completed.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.