Competition problem — Number theory

Library / /140 of 520

Number theory Difficulty 5.7 AIME, harder Prove it

32. Let the prime $p=2^{4 n}+1$ . Prove: 7 is a primitive root of $p$ .

Solution

32. This is part of Question 15 (vi $)$ .

Translating the text above into English, please keep the original text's line breaks and format, and output the translation result directly.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.