olymmath

ÖMO 2020 Problem 3

    Let aa be a fixed positive integer and (en)(e_n) the sequence, which is defined by e0=1e_0=1 and en=a+∏k=0n−1eke_n=a + \prod_{k=0}^{n-1} e_k for n≥1n \geq 1 .

    Prove that (a) There exist infinitely many prime numbers that divide one element of the sequence. (b) There exists one prime number that does not divide an element of the sequence.

    (Theresia Eisenkölbl)

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