MathCastle
OlympiadSuperchallengeOlympiad Number Theory

Olympiad Number Theory · Superchallenge problem

Find the order of 66 modulo 1313 (the least positive dd with 6d≡1(mod13)6^d \equiv 1 \pmod{13}).