Understand the problem

For a polynomial $f(x)$ with integer coefficients and degree no less than $1$, prove that there are infinitely many primes $p$ which satisfies the following. There exists an integer $n$ such that $f(n) \not= 0$ and $|f(n)|$ is a multiple of $p$.
Source of the problem
Korea Junior MO Problem 7
Topic
Number Theory
Difficulty Level
8/10
Suggested Book
Elementary Number Theory by David Burton

Start with hints

Do you really need a hint? Try it first!

Well, remember the proof that the set of prime numbers is infinite? We started with the assumption that let there be a finite number of prime numbers and then reached a contradiction that there needs to be another extra prime number given that set. Hence, the set of prime numbers is infinite. This problem is also famously known as Schur’s Theorem. Observe that the problem can be restated as every nonconstant polynomial p(x) with integer coefficients if S is the set of all nonzero values,
then the set of primes that divide some member of S is infinite. Let us start by assuming that the set is indeed finite. Let $A$ this set of primes $p$ such that $\exists n$ such than $f(n)\ne 0$ and $p|f(n)$. Let |A| be finite.
 
If $f(0)=0$ the result is immediate since $p|f(p^n)$ $\forall p$ (just choose $n$ such that $f(p^n)\ne 0$ and so any prime $p\in A$. Now let’s take the case when f(0) is non-zero. Let’s take \( f(x) = a_n.x^n + … a_1.x + f(0)\). Now, \( f(c.f(0)) = a_n.{c.f(0)}^n + … a_1.f(0) + f(0) = f(0).( a_n.c.{cf(0)}^{n-1} + … + a_2.c^2.f(0) + a_1.c + 1 )\). Can you give some appropiate c to show that another prime must exist?    
Take c = product of all the primes in A. Prove that it implies some other prime must exist which is not in A.
Now, \( f(c.f(0)) = a_n.{c.f(0)}^n + … a_1.f(0) + f(0) = f(0).( a_n.c.{cf(0)}^{n-1} + … + a_2.c^2.f(0) + a_1.c + 1 )\). Observe that if we take c as mentioned then, i.e. c = product of all the primes in A. Then all f(c.f(0)) must be coprime to all the primes in A. Therefore, it must have a prime factor other than those in A. Hence, a contradiction in the finiteness in A. QED.  

Watch video

Connected Program at Cheenta

Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year. Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

Similar Problems

RMO 2019 (Maharashtra Goa) Adding GCDs

Can you add GCDs? This problem from RMO 2019 (Maharashtra region) has a beautiful solution. We also give some bonus questions for you to try.

Number Theory, Ireland MO 2018, Problem 9

This problem in number theory is an elegant applications of the ideas of quadratic and cubic residues of a number. Try with our sequential hints.

Number Theory, France IMO TST 2012, Problem 3

This problem is an advanced number theory problem using the ideas of lifting the exponents. Try with our sequential hints.

Algebra, Austria MO 2016, Problem 4

This algebra problem is an elegant application of culminating the ideas of polynomials to give a simple proof of an inequality. Try with our sequential hints.

Number Theory, Cyprus IMO TST 2018, Problem 1

This problem is a beautiful and simple application of the ideas of inequality and bounds in number theory. Try with our sequential hints.

Number Theory, South Africa 2019, Problem 6

This problem in number theory is an elegant applciations of the modulo technique used in the diophantine equations. Try with our sequential hints

Number Theory, Korea Junior MO 2015, Problem 7

This problem in number theory is an elegant application of the ideas of the proof of infinitude of primes from Korea. Try with our sequential hints.

Inequality, Israel MO 2018, Problem 3

This problem is a basic application of triangle inequality along with getting to manipulate the modulus function efficently. Try with our sequential hints.

Number Theory, Greece MO 2019, Problem 3

This problem is a beautiful application of prime factorization theorem, and reveal how important it is. Try with our sequential hints.

Algebra, Germany MO 2019, Problem 6

This problem is a beautiful application of algebraic manipulations, ideas of symmetry, and vieta’s formula in polynomials. Try with our sequential hints.