Number theoryDifficulty 5.2AIME, harderProve itUkraine
Find all positive integers n such that nn+1 is divisible by n+1.
Solution
For odd integer n it is enough to decompose: nn+1=(n+1)(nn−1−nn−2+nn−3−⋯+1). Let's assume that there exists an even number n=2k such that K=(2k)2k+1 is divisible by 2k+1. Then 2k+1 is also a divisor of 2kK=(2k)2k+1+2k=((2k)2k+1+1)+(2k−1). Since (2k)2k+1+1=(2k+1)((2k)2k−(2k)2k−1+(2k)2k−2−⋯+1), then 2k−1 must also be divisible by 2k+1. This is impossible and therefore no even number n satisfies the condition.
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.