Library / /43 of 120

, 2012

Number theory Difficulty 5.0 AIME, harder Prove it Saudi Arabia

Find all positive integers $n$ such that $5^{n^2} + 7$ is divisible by $6$ .

Solution

We have $5^{n^2} + 7 = (6 - 1)^{n^2} + 7 \equiv (-1)^{n^2} + 1 \pmod{6}$ . It follows that $5^{n^2} + 7$ is divisible by $6$ if and only if $(-1)^{n^2} + 1 = 0$ . This is equivalent to $n^2$ being odd. Therefore, the possible values of $n$ are all odd positive integers.

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.