AlgebraDifficulty 6.9National olympiadFind the answer
Find all monic polynomials P(x) such that the polynomial P(x)2−1 is divisible by the polynomial P(x+1).
A number or a short expression. Spacing and $ signs are ignored.
Solution
1. Initial Setup and Monic Polynomial Definition: We are given that P(x) is a monic polynomial such that P(x)2−1 is divisible by P(x+1). A monic polynomial is a polynomial whose leading coefficient is 1.
2. Case for Degree 0 and 1: - For deg(P(x))=0, P(x) is a constant polynomial. Let P(x)=c. Then P(x)2−1=c2−1. For P(x+1)=c to divide c2−1, c must be ±1. Since P(x) is monic, c=1. Thus, P(x)=1. - For deg(P(x))=1, let P(x)=x+b. Then P(x+1)=x+b+1 and P(x)2−1=(x+b)2−1=(x+b−1)(x+b+1). Clearly, P(x+1)=x+b+1 divides (x+b−1)(x+b+1).
3. **Claim: All Roots of P(x) are the Same**: Suppose P(x) has degree n≥2. We can write P(x)=∏i=1n(x−zi) where zi are the roots of P. Without loss of generality, assume Re(z1)≤Re(z2)≤⋯≤Re(zn).
4. **Evaluating ∣P(zi−1)∣=1**: Since P(x+1) divides P(x)2−1, for any root zi of P, P(zi−1)=0. Thus, ∣P(zi−1)∣=1. We have: 1=∣P(z1−1)∣=i=1∏n(z1−1−zi)=i=1∏n∣z1−1−zi∣ Since Re(z1−zi−1)≤−1, we have ∣z1−zi−1∣≥1. Therefore: i=1∏n∣z1−1−zi∣≥i=1∏n1=1 Equality must hold, implying ∣z1−zi−1∣=1 for all i. This forces z1=zi for all i, meaning all roots are the same.
5. **Form of P(x)**: Since all roots are the same, P(x)=(x−c)n for some constant c.
6. Divisibility Condition: We need P(x+1)=(x−c+1)n to divide P(x)2−1=((x−c)n)2−1. Notice: P(x)2−1=((x−c)n)2−1=((x−c)n−1)((x−c)n+1) Since gcd((x−c)n−1,(x−c)n+1)=1, P(x+1) must divide either (x−c)n−1 or (x−c)n+1. Given the degrees, this implies: P(x+1)=P(x)+1orP(x+1)=P(x)−1
7. **Polynomials Satisfying P(x+1)=P(x)±1**: The only polynomials satisfying P(x+1)−P(x)=1 or P(x+1)−P(x)=−1 are linear polynomials. Thus, P(x)=x+b for some b∈Z.
Conclusion: The only monic polynomials P(x) such that P(x)2−1 is divisible by P(x+1) are P(x)=1 and P(x)=x+b for any b∈Z.
The final answer is P(x)=1 and P(x)=x+b for any b∈Z.
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.