MathCastle
OlympiadSuperchallengeOlympiad Number Theory

Olympiad Number Theory · Superchallenge problem

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