olymmath

US-TST 2010 Problem 1

    Let PP be a polynomial with integer coefficients such that P(0)=0P(0)=0 and gcd⁡(P(0),P(1),P(2),…)=1.\gcd(P(0), P(1), P(2), \ldots ) = 1. Show there are infinitely many nn such that gcd⁡(P(n)−P(0),P(n+1)−P(1),P(n+2)−P(2),…)=n.\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \ldots) = n.

    Dataset text AI-MO AoPS. 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

    Similar problems

    These problems have the most words in common with this statement.

    Locator us-tst/2010/p1 · Tag 6XWD043EKJ · Edit this page on GitHub · Keys: j next, k previous