Prove that for all natural n≥2 the following number is composite: n+1n1003+n1002+n1001+1
Solution
Since n1003+n1002+n1001+1=n1001(n2+1)+n1002+1=n1001(n2+1)+(n2+1)(n1000−n998+n996−⋯−n2+1) hence, the numerator is divisible by n2+1. We can see that the numerator is also divisible by n+1, as follows from the equation: n1003+n1002+n1001+1=n1002(n+1)+n1001+1=n1002(n+1)+(n+1)(n1000−n998+n996−⋯−n+1).
n+1n1003+n1002+n1001+1=n+1(n+1)(n2+1)P(n)=(n2+1)P(n). It is easy to see that P(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.