Maths Olympiad Prep

Library / /10 of 24

Number theory Difficulty 4.6 AIME Prove it United States

Problem:
Find the sum of all positive integers nn such that nn divides n2+n+2n^{2}+n+2.

Solution

Solution:
Since nn always divides n2+nn^{2}+n, the only nn that work are divisors of 22, because if nn divides aa and nn divides bb, then nn divides a+ba+b. So the solutions are 11 and 22 which sum to 33.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.