benchmarks.wiki / Public workspace

Omni-MATH / Find all integers n≥2 for which there exists an integer m and a polynomial P(x) with integer coefficients satisfying the following three conditions: [list] [*]m>1 and gcd(m,n)=1; […

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Find all integers n2n \ge 2 for which there exists an integer mm and a polynomial P(x)P(x) with integer coefficients satisfying the following three conditions: [list] [*]m>1m > 1 and gcd(m,n)=1\gcd(m,n) = 1; [*]the numbers P(0)P(0), P2(0)P^2(0), \ldots, Pm1(0)P^{m-1}(0) are not divisible by nn; and [*]Pm(0)P^m(0) is divisible by nn. [/list] Here PkP^k means PP applied kk times, so P1(0)=P(0)P^1(0) = P(0), P2(0)=P(P(0))P^2(0) = P(P(0)), etc. [i]Carl Schildkraut[/i]
Plain-text mathematical notation (without MathML)
Find all integers n≥2 for which there exists an integer m and a polynomial P(x) with integer coefficients satisfying the following three conditions: [list] 	[*]m>1 and gcd(m,n)=1; 	[*]the numbers P(0), P²(0), …, P^(m−1)(0) 		are not divisible by n; and 	[*]P^(m)(0) is divisible by n. [/list] Here P^(k) means P applied k times, so P¹(0)=P(0), P²(0)=P(P(0)), etc.

[i]Carl Schildkraut[/i]
Original LaTeX notation
Find all integers $n \ge 2$ for which there exists an integer $m$ and a polynomial $P(x)$ with integer coefficients satisfying the following three conditions: [list] 	[*]$m > 1$ and $\gcd(m,n) = 1$; 	[*]the numbers $P(0)$, $P^2(0)$, $\ldots$, $P^{m-1}(0)$ 		are not divisible by $n$; and 	[*]$P^m(0)$ is divisible by $n$. [/list] Here $P^k$ means $P$ applied $k$ times, so $P^1(0) = P(0)$, $P^2(0) = P(P(0))$, etc.

[i]Carl Schildkraut[/i]

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import