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

If $f(x)$ and $g(x)$ are polynomials over $\mathbb{Z}$ and $f(n)|g(n)$ for all $n\in \mathbb{Z}$ then does it follow that $f$ divides $g$ in $\mathbb{Z}[x]?$

I'm pretty sure the answer is yes and that the proof should be easy (in fact I think it should be true with far weaker assumptions), but can't seem to get too far. If it helps, note in particular that $f$ has no integral roots.

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

Nope, but for silly reasons. Take $f(x) = 2, g(x) = x^2 + x$.

If $f$ is monic, the proof is straightforward: using the division algorithm we may assume WLOG that $g$ has degree strictly less than $f$ and then $\frac{g}{f}$ eventually tends to zero, so must itself be zero.

share|cite|improve this answer
Thanks! Do you know of necessary/sufficient conditions that would make it true? – Jon May 27 '12 at 3:53
@Jon: not beyond what I've already said. – Qiaochu Yuan May 27 '12 at 4:00

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.