olymmath

US-TST 2005 Problem 3

    We choose random a unitary polynomial of degree nn and coefficients in the set 1,2,...,n!1,2,...,n! . Prove that the probability for this polynomial to be special is between 0.710.71 and 0.750.75 , where a polynomial gg is called special if for every k>1k>1 in the sequence f(1),f(2),f(3),...f(1), f(2), f(3),... there are infinitely many numbers relatively prime with kk .

    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/2005/p3 · Tag AXB0WZ98K0 · Edit this page on GitHub · Keys: j next, k previous