2

Prove that for each $n$, there exist $n$ consecutive integers, each of which is divisible by a perfect square larger than $1$. Can any one help with this? I was stuck because I know how to solve for a particular $n$ value, but I was helpless in the generalized form.

1233dfv
  • 5,625

1 Answers1

5

Use the Chinese Remainder Theorem on the congruences:

$$x \equiv 0 \pmod{2^2} \\ x+1 \equiv 0 \pmod{3^2} \\ x+2 \equiv 0 \pmod{5^2} \\ \dots$$

Old John
  • 19,569
  • 3
  • 59
  • 113