Competition problem — Number theory

Library / /103 of 520

Number theory Difficulty 5.6 AIME, harder Prove it

8. Show that if $p$ is an odd prime and $r$ is a primitive root of $p$ , then ind $(p-1)=$ $(p-1) / 2$ .

Solution

None

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.