olymmath

OBM 2014 Problem 2

    Find all integers nn , n>1n>1 , with the following property: for all kk , 0≤k<n0\le k < n , there exists a multiple of nn whose digits sum leaves a remainder of kk when divided by nn .

    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 br-obm/2014/p2 · Tag D5E4HRRK6P · Edit this page on GitHub · Keys: j next, k previous