A computational method to solve the following problem from the 2014 High School Purple Comet I had to do for homework: For positive integers m and n, let r(m, n) be the remainder when m is divided by n. Find the smallest positive integer m such that r(m, 1)+r(m, 2)+r(m, 3)+r(m, 4)+r(m, 5)+r(m, 6)+r(m, 7)+r(m, 8)+r(m, 9)+r(m, 10)=4. I DID NOT use this to cheat.
