Skip to main content
OlympiadHQ

Browse · MathNet

Print

62nd Ukrainian National Mathematical Olympiad, Third Round, First Tour

Ukraine number theory

Problem

Does there exist a trinomial with integer coefficients such that isn't divisible by and all numbers give different remainders under the division by ?
Solution
Consider the following trinomial: The first term is always divisible by , so gives remainder . Proof completed.

Techniques

Factorization techniquesOtherPolynomial operations