olymmath

JBMO-SL 2021 N6

    Given a positive integer n≥2n \ge 2 , we define f(n)f(n) to be the sum of all remainders obtained by dividing nn by all positive integers less than nn . For example dividing 55 with 1,2,31, 2, 3 and 44 we have remainders equal to 0,1,20, 1, 2 and 11 respectively. Therefore f(5)=0+1+2+1=4f(5) = 0 + 1 + 2 + 1 = 4 . Find all positive integers n≥3n \ge 3 such that f(n)=f(n−1)+(n−2)f(n) = f(n - 1) + (n - 2) .

    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 jbmo-sl/2021/n6 · Tag KVS922A7W8 · Edit this page on GitHub · Keys: j next, k previous