Benchmark AI / Public workspace
Omni-MATH / Let P be a polynomial with integer coefficients such that P(0)=0 and
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
Let be a polynomial with integer coefficients such that and
Show there are infinitely many such that
Plain-text mathematical notation (without MathML)
Let P be a polynomial with integer coefficients such that P(0)=0 and gcd(P(0),P(1),P(2),…)=1. Show there are infinitely many n such that gcd(P(n)−P(0),P(n+1)−P(1),P(n+2)−P(2),…)=n.
Original LaTeX notation
Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and \[\gcd(P(0), P(1), P(2), \ldots ) = 1.\] Show there are infinitely many $n$ such that \[\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \ldots) = n.\]
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.
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
initial import