MathDB
analysis

Source: miklos schweitzer 1998 q2

September 18, 2021
polynomialreal analysis

Problem Statement

For any polynomial f, denote by PfP_f the number of integers n for which f(n) is a (positive) prime number. Let qd=maxPfq_d = max P_f , where f runs over all polynomials with integer coefficients with degree d and reducible over Q\mathbb{Q}. Prove that ∀d≥2\forall d\geq 2 , qd=dq_d = d.
Back to ProblemsView on AoPS