Maths Olympiad Prep

Library / /14 of 62

Algebra Difficulty 5.0 AIME Prove it Ukraine

Prove that for all natural n2n \ge 2 the following number is composite:
n1003+n1002+n1001+1n+1 \frac{n^{1003} + n^{1002} + n^{1001} + 1}{n+1}

Solution

Since
n1003+n1002+n1001+1=n1001(n2+1)+n1002+1=n1001(n2+1)+(n2+1)(n1000n998+n996n2+1) \begin{aligned} n^{1003} + n^{1002} + n^{1001} + 1 &= n^{1001}(n^2 + 1) + n^{1002} + 1 \\ &= n^{1001}(n^2 + 1) + (n^2 + 1)(n^{1000} - n^{998} + n^{996} - \dots - n^2 + 1) \end{aligned}
hence, the numerator is divisible by n2+1n^2 + 1. We can see that the numerator is also divisible by n+1n+1, as follows from the equation:
n1003+n1002+n1001+1=n1002(n+1)+n1001+1=n1002(n+1)+(n+1)(n1000n998+n996n+1). \begin{aligned} n^{1003} + n^{1002} + n^{1001} + 1 &= n^{1002}(n+1) + n^{1001} + 1 \\ &= n^{1002}(n+1) + (n+1)(n^{1000} - n^{998} + n^{996} - \dots - n + 1). \end{aligned}

n1003+n1002+n1001+1n+1=(n+1)(n2+1)P(n)n+1=(n2+1)P(n). \frac{n^{1003} + n^{1002} + n^{1001} + 1}{n+1} = \frac{(n+1)(n^2+1)P(n)}{n+1} = (n^2+1)P(n).
It is easy to see that P(n)>1P(n) > 1. The statement has been proven.

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.