Example 5 Let all be positive integers, and the number is a common divisor of and . Prove: is a composite number.
Solution
Prove that for the polynomial
From the given conditions, it is known that for any , .
In particular, , i.e.,
Combining the fact that the numbers are all less than , it follows that is a composite number. The proposition is proved.
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.