The sequence {xn} is defined by x1\equal2,x2\equal12, and xn\plus2\equal6xn\plus1\minusxn, (n\equal1,2,…). Let p be an odd prime number, let q be a prime divisor of xp. Prove that if q=2,3, then q≥2p\minus1.
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
1. Define the sequence and initial conditions: The sequence {xn} is defined by: x1=2,x2=12,andxn+2=6xn+1−xnforn=1,2,…
2. Find the general form of the sequence: We claim that the general form of the sequence is: xn=221((3+22)n−(3−22)n) We will prove this by induction.
3. Base Case: For n=1: x1=2=221((3+22)1−(3−22)1)=221(3+22−3+22)=2 For n=2: x2=12=221((3+22)2−(3−22)2) Calculate (3+22)2 and (3−22)2: (3+22)2=9+122+8=17+122 (3−22)2=9−122+8=17−122 Thus, x2=221((17+122)−(17−122))=221(242)=12
4. Induction Hypothesis: Assume the result holds for n=k and n=k−1: xk=221((3+22)k−(3−22)k) xk−1=221((3+22)k−1−(3−22)k−1)
5. Induction Step: We need to show it holds for n=k+1: xk+1=6xk−xk−1 Using the induction hypothesis: xk+1=6⋅221((3+22)k−(3−22)k)−221((3+22)k−1−(3−22)k−1) Simplify: xk+1=221(6(3+22)k−6(3−22)k−(3+22)k−1+(3−22)k−1) Using the recurrence relation: (3+22)k+1=6(3+22)k−(3+22)k−1 (3−22)k+1=6(3−22)k−(3−22)k−1 Therefore, xk+1=221((3+22)k+1−(3−22)k+1) This completes the induction step.
6. Conclusion: We have shown that: xn=221((3+22)n−(3−22)n)
7. Prime divisor analysis: Let p be an odd prime number, and let q be a prime divisor of xp. We need to show that if q=2,3, then q≥2p−1.
8. Case analysis based on Legendre symbol: - If (p2)=1, then 3±22=(1±2)2∈Fp. By Fermat's Little Theorem: x2p−1=221((3+22)2p−1−(3−22)2p−1)≡0(modp) - If (p2)=−1, then: (1±2)p≡1±2(modp) Thus, x2p+1=221((3+22)2p+1−(3−22)2p+1)≡0(modp)
9. Conclusion: If q=2,3, then q≥2p−1.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.