Maths Olympiad Prep

Library / North Macedonia competition problems /1 of 8

North Macedonia competition problems

Number theory Difficulty 4.5 AIME Prove it North Macedonia

Let nn be a natural number. Prove that 13∣7n+n513|7^n + n^5 if and only if 13∣n7⋅7n+113|n^7 \cdot 7^n + 1.

Solution

Let 13∣7n+n513|7^n + n^5. Clearly 1313 does not divide nn, so by Little Fermat's theorem we have that n12≡1(mod13)n^{12} \equiv 1 \pmod{13}, i.e. 13∣n12−113|n^{12} - 1.

Now we have 13∣7n+n513|7^n + n^5, i.e. 13∣n7(7n+n5)13|n^7(7^n + n^5) or 13∣n77n+1+n12−113|n^7 7^n + 1 + n^{12} - 1, and because of 13∣n12−113|n^{12} - 1 we get 13∣n7⋅7n+113|n^7 \cdot 7^n + 1.

Now let 13∣n7⋅7n+113|n^7 \cdot 7^n + 1; clearly 1313 does not divide nn, so as previously we have 13∣n12−113|n^{12} - 1. We get 13∣n7⋅7n+113|n^7 \cdot 7^n + 1, i.e. 13∣n5(n7⋅7n+1)13|n^5(n^7 \cdot 7^n + 1), i.e. 13∣n12⋅7n+n513|n^{12} \cdot 7^n + n^5, or 13∣(n12−1)7n+7n+n513|(n^{12} - 1)7^n + 7^n + n^5, from where we have that 13∣7n+n513|7^n + n^5, which concludes the proof.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.