Library / /181 of 520
Number theory Difficulty 5.9 AIME, harder Prove it
5. Show that if aˉ is an inverse of a modulo n, then ordna=ordnaˉ.
Solution
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.