MathDB
2008 PUMaC Number Theory B7

Source:

October 4, 2019
number theory

Problem Statement

In this problem, we consider only polynomials with integer coeffients. Call two polynomials pp and qq really close if p(2k+1)≡q(2k+1)p(2k + 1) \equiv q(2k + 1) (mod 210210) for all k∈Z+k \in Z^+. Call a polynomial pp partial credit if no polynomial of lesser degree is really close to it. What is the maximum possible degree of partial credit?
Back to ProblemsView on AoPS