Use Euler's Theorem to confirm that, for any integer n >= 0, 51 | 10^(32n+9) - 7 Euler's Theorem: If n>= 1 and gcd (a,n) = 1, then a^(phi(n)) = 1 (mod n).