Let be an odd prime number, and let denote the field of integers modulo . Let be the ring of polynomials over , and let be given by where Find the greatest nonnegative integer such that divides in .
Solution
The answer is . Define the operator , where indicates formal differentiation of polynomials. For as in the problem statement, we have for some polynomial in not divisible by . For , by the product rule we have Since and (because ), we may identify as the smallest nonnegative integer for which .
Now note that for since in . By the same logic as above, for but not for . This implies the claimed result.
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.