Already have an account? Log in here.
Considering the remainder "modulo" an integer is a powerful, foundational tool in Number Theory. You already use in clocks and work modulo 12.
Given that \( 9 \equiv 2 \pmod{7} \), what is
\[ 9 \times 9 \times 9 \times 9 \times 9 \pmod{7}? \]
Already have an account? Log in here.
What is \( 2 ^ {15} \pmod{11} ?\)
Already have an account? Log in here.
What is \( 5 ^ {34} \pmod{31} ?\)
Already have an account? Log in here.
Which of the following is congruent to \[ \large 7^{7^{7^{7^7}}} \pmod {10}? \]
Already have an account? Log in here.
What is \( 2 ^ {7} \pmod{10} ?\)
Already have an account? Log in here.
Problem Loading...
Note Loading...
Set Loading...