OlympiadSuperchallengeOlympiad Number Theory ShareOlympiad Number Theory · Superchallenge problemFind the order of 666 modulo 131313 (the least positive ddd with 6d≡1(mod13)6^d \equiv 1 \pmod{13}6d≡1(mod13)).Check Show answer Walk through it step by step Practice more like this Review this concept