olymmath

ILL 1978 Problem 26

    For every integer d≥1d \geq 1, let MdM_d be the set of all positive integers that cannot be written as a sum of an arithmetic progression with difference dd, having at least two terms and consisting of positive integers. Let A=M1A = M_1, B=M2∖{2},C=M3B = M_2 \setminus \{2 \}, C = M_3. Prove that every c∈Cc \in C may be written in a unique way as c=abc = ab with a∈A,b∈B.a \in A, b \in B.

    Dataset text AoPS wiki problems. 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 ill/1978/p26 · Tag NPGB3S508T · Edit this page on GitHub · Keys: j next, k previous