olymmath

US-TST 2020 Problem 5

    Find all integers n≥2n \geq 2 for which there exists an integer mm and a polynomial P(x)P(x) with integer coefficients satisfying the following three conditions: - m>1m>1 and gcd⁡(m,n)=1\operatorname{gcd}(m, n)=1; - the numbers P(0),P2(0),…,Pm−1(0)P(0), P^{2}(0), \ldots, P^{m-1}(0) are not divisible by nn; and - Pm(0)P^{m}(0) is divisible by nn. Here PkP^{k} means PP applied kk times, so P1(0)=P(0),P2(0)=P(P(0))P^{1}(0)=P(0), P^{2}(0)=P(P(0)), etc.

    Dataset text NuminaMath olympiads. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Locator us-tst/2020/p5 · Tag 5J2MSQ5HYA · Edit this page on GitHub · Keys: j next, k previous