MathDB
Spring 2020 Team Round Problem 29

Source:

August 22, 2020

Problem Statement

Let F\mathcal{F} be the set of polynomials f(x)f(x) with integer coefficients for which there exists an integer root of the equation f(x)=1f(x)=1. For all k>1k>1, let mkm_k be the smallest integer greater than one for which there exists f(x)Ff(x)\in \mathcal{F} such that f(x)=mkf(x)=m_k has exactly kk distinct integer roots. If the value of m2021m2020\sqrt{m_{2021}-m_{2020}} can be written as mnm\sqrt{n} for positive integers m,nm,n where nn is squarefree, compute the largest integer value of kk such that 2k2^k divides mn\frac{m}{n}.