olymmath

KURSCHAK 1981 Problem 3

    For a positive integer nn , r(n)r(n) denote the sum of the remainders when nn is divided by 1,2,...,n1, 2,..., n respectively. Prove that r(k)=r(k−1)r(k) = r(k -1) for infinitely many positive integers kk .

    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 kurschak/1981/p3 · Tag 2EZM96RSMG · Edit this page on GitHub · Keys: j next, k previous