olymmath

CZ-SK-MO 1997 Problem 4

    Show that there exists an increasing sequence a1,a2,a3,...a_1,a_2,a_3,... of natural numbers such that, for any integer k≥2k \ge 2 , the sequence k+ank+a_n ( n∈Nn \in N ) contains only finitely many primes.

    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 cz-sk-mo/1997/p4 · Tag QM9E5J4PE7 · Edit this page on GitHub · Keys: j next, k previous