1974 IMO Problems/Problem 6

Revision as of 14:33, 17 February 2018 by Durianaops (talk | contribs) (Created page with "==Problem== Let <math>P</math> be a non-constant polynomial with integer coefficients. If <math>n(P)</math> is the number of distinct integers <math>k</math> such that <math>(...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $P$ be a non-constant polynomial with integer coefficients. If $n(P)$ is the number of distinct integers $k$ such that $(P(k))^2=1,$ prove that $n(P)-\deg(P)\le2,$ where $\deg(P)$ denotes the degree of the polynomial $P.$

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

1974 IMO (Problems) • Resources
Preceded by
Problem 5
1 2 3 4 5 6 Followed by
Last Question
All IMO Problems and Solutions