Modular Arithmetic (Easy)

Modular Arithmetic: core idea

• 1. Compute $2^5\bmod 7$.

  Check

• 2. How many integers $1\le n\le 50$ satisfy $n\equiv 2\pmod 5$?

  Check

• 3. Compute $3^4\bmod 5$.

  Check

• 4. How many integers $1\le n\le 40$ satisfy $n\equiv 0\pmod 4$?

  Check

• 5. Compute $5^3\bmod 8$.

  Check

• 6. What is the remainder when $100$ is divided by $9$?

  Check

• 7. Compute $7^2\bmod 10$.

  Check

• 8. How many integers $1\le n\le 60$ satisfy $n\equiv 1\pmod 6$?

  Check

• 9. Compute $4^3\bmod 9$.

  Check