To show that for n>1 we can find a polynomial P(a,b,c) with integer coefficients such that
P(xn,xn+1,x+xn+2)=x,
we need to demonstrate that x is in the ideal generated by xn,xn+1,x+xn+2 in Z[x].
1. Define the Ideal:
Let I be the ideal in Z[x] generated by xn,xn+1,x+xn+2. That is,
I=⟨xn,xn+1,x+xn+2⟩.
2. **Express x in Terms of Generators:**
We need to find a polynomial P(a,b,c) such that
P(xn,xn+1,x+xn+2)=x.
This means we need to express x as a combination of xn,xn+1, and x+xn+2.
3. Use Gröbner Basis Theory:
Gröbner basis theory provides a systematic way to solve polynomial equations and find such polynomials. Using software like Maple, we can compute the required polynomial P(a,b,c).
4. Example Calculation:
For specific values of u,v,w, we can compute the polynomial. For instance, let u=72,v=25,w=41. Using Gröbner basis theory, we obtain:
x=152b6c11−bc16−21629555a5b8c+a5b3c6−216275437a4b6c3+10a4bc8−216115685a3b9−72236843a3b4c5+72791a2b7c2−1820611a2b2c7+3635509ab5c4+8ac9+2162123a8b−3618911b8c+8b3c6−2452943a5c−42099a3b+c.
5. General Case:
When gcd(u,v)=1, we may only get x as a rational fraction. For example, for u=72,v=30,w=41, we obtain:
x=31c(3b3c10−3a3b4c4−33ab2c8+11b10+15a4b3c2+113a2bc6+4a5b2−120a3c4+13b6−3b2)/(−a2bc6+3a3c4−b6−b2).
6. Conclusion:
Therefore, for n>1, we can indeed find a polynomial P(a,b,c) with integer coefficients such that P(xn,xn+1,x+xn+2)=x.
■