Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question

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$$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.