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