Maths Olympiad Prep

Library / /1 of 12

, 2019

Number theory Difficulty 7.5 National olympiad, round 2 Prove it Romania

Determine all positive integers nn for which nn+1+n1n^{n+1} + n - 1 is the sixth power of an integer.

Solution

Clearly, n=1n = 1 satisfies the required condition. We now proceed to rule out all integers n>1n > 1.

If nn is odd, n3n \geq 3, then nn+1+n1n^{n+1} + n - 1 falls strictly between the squares of two consecutive integers,
(n(n+12))2<nn+1+n1<(n(n+12)+1)2, \left( n^{\left( \frac{n+1}{2} \right)} \right)^2 < n^{n+1} + n - 1 < \left( n^{\left( \frac{n+1}{2} \right)} + 1 \right)^2,
so it is not the square, and hence all the less the sixth power of an integer.

Similarly, if n2(mod3)n \equiv 2 \pmod{3}, then nn+1+n1n^{n+1} + n - 1 falls strictly between the cubes of two consecutive integers,
(n(n+1)3)3<nn+1+n1<(n(n+1)3+1)3, \left(n^{\frac{(n+1)}{3}}\right)^3 < n^{n+1} + n - 1 < \left(n^{\frac{(n+1)}{3}} + 1\right)^3,
so it is not the cube, and hence all the less the sixth power of an integer.

If n0(mod3)n \equiv 0 \pmod{3}, then nn+1+n11(mod3)n^{n+1} + n - 1 \equiv -1 \pmod{3}, so it is not the square, and hence all the less the sixth power of an integer.

Finally, to rule out the only case left, n4(mod6)n \equiv 4 \pmod{6}, notice that
nn+1+n1(1)n+1113(modn+1). n^{n+1} + n - 1 \equiv (-1)^{n+1} - 1 - 1 \equiv -3 \pmod{n+1}.
Since n+15(mod6)n+1 \equiv 5 \pmod{6}, it has a prime divisor p2(mod3)p \equiv 2 \pmod{3}, p>3p > 3, so 3-3 is not a quadratic residue modulo pp. Consequently, nn+1+n1n^{n+1} + n - 1 is not a quadratic residue modulo pp, and hence all the less the square of an integer, let alone the sixth power of one such.

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 and solution reproduced as published; topic and difficulty added by this site.