olymmath

CMOQR 2022 Problem 4

    For a non-negative integer nn , call a one-variable polynomial FF with integer coefficients nn -good if: (a) F(0)=1F(0) = 1 (b) For every positive integer cc , F(c)>0F(c) > 0 , and (c) There exist exactly nn values of cc such that F(c)F(c) is prime. Show that there exist infinitely many non-constant polynomials that are not nn -good for any nn .

    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 ca-cmoqr/2022/p4 · Tag 877YFYAGX2 · Edit this page on GitHub · Keys: j next, k previous