We claim that for each f(j)(j) is an integer, and that this integer is divisible by p unless j=0 and i=p−1. To establish the claim we just apply Liebniz's rule; the only non-zero term arising when j=0 come from the factor (x−j)p being differentiated exactly p times. Since (p−1)p!=p, all such terms are integers divisible by p. In the exceptional case j=0, the frist non-zero term occurs when i=p−1, and then
f(p−1)(0)=(−1)p...(−m)p
The next non-zero terms are all multiples of p. The value of equation (Φ) is therefore
Kp+a0(−1)p...(−m)p
for some K∈Z. If p>max(m,∣a0∣), then the integer a0(−1)p...(−m)p is not divisible by p. So fot sufficiently large primes p the value of the equation (Φ) is an integer not divisible by p, hence not zero.
We claim that for each f(j)(j) is an integer, and that this integer is divisible by p unless j=0 and i=p−1. To establish the claim we just apply Liebniz's rule; the only non-zero term arising when j=0 come from the factor (x−j)p being differentiated exactly p times. Since (p−1)p!=p, all such terms are integers divisible by p. In the exceptional case j=0, the frist non-zero term occurs when i=p−1, and then
f(p−1)(0)=(−1)p...(−m)p
The next non-zero terms are all multiples of p. The value of equation (Φ) is therefore
Kp+a0(−1)p...(−m)p
for some K∈Z. If p>max(m,∣a0∣), then the integer a0(−1)p...(−m)p is not divisible by p. So fot sufficiently large primes p the value of the equation (Φ) is an integer not divisible by p, hence not zero.