MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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

Is there an integer polynomial $ A \in {\mathbb Z} [ X ]$ of degree $d\geq 2$ such that for any integer $n\in {\mathbb Z}$ , $ A(n) $ is a square-free integer?

share|cite|improve this question
up vote 12 down vote accepted

No. WLOG $A$ is irreducible. Pick a sufficiently large prime $p$ dividing $A(k)$ for some $k$ (there are infinitely many such primes, for example by the argument here). In particular pick $p$ large enough so that it is relatively prime to the coefficients of $A$ and to $d$, and so that it does not divide the discriminant of $A$. Then the congruence $A(x) \equiv 0 \bmod p^2$ has a solution by Hensel's lemma.

share|cite|improve this answer
If there are only n primes dividing A(k) as k varies, there are only 2^n possibilities for squarefree values of A(k), and then you can use the fact that the polynomial is unbounded. – mathahada Nov 6 '10 at 11:14
Thanks Qiaochu. If I had been more familiar with p-adic analysis, I probably wouldn't have needed to ask the question here. – Ewan Delanoy Nov 6 '10 at 12:30

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.