Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recursionhard
0:00.0

For the multiplicative recurrence an=5an−1(mod11)a_n = 5a_{n-1} \pmod{11}an​=5an−1​(mod11) with a0=1a_0 = 1a0​=1, we have an=5n(mod11)a_n = 5^n \pmod{11}an​=5n(mod11). Find the period by computing the order of 5 modulo 11 (the smallest positive kkk such that 5k≡1(mod11)5^k \equiv 1 \pmod{11}5k≡1(mod11)).