olymmath

BG-MO 1985 Problem 1

    Let f(x)f(x) be a non-constant polynomial with integer coefficients and n,kn,k be natural numbers. Show that there exist nn consecutive natural numbers a,a+1,…,a+n−1a,a+1,\ldots,a+n-1 such that the numbers f(a),f(a+1),…,f(a+n−1)f(a),f(a+1),\ldots,f(a+n-1) all have at least kk prime factors. (We say that the number p1α1⋯psαsp_1^{\alpha_1}\cdots p_s^{\alpha_s} has α1+…+αs\alpha_1+\ldots+\alpha_s prime factors.)

    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 bg-mo/1985/p1 · Tag XHE8D3G0R1 · Edit this page on GitHub · Keys: j next, k previous