Modular arithmetic is a way of counting in which the numbers wrap around after reaching a certain value. The clock is often used as an analogy. One important application for modular arithmetic is Fermat’s Little Theorem which states that if p is a prime number and a is not divisible by p, then ap-1 ≡ 1 (mod p). This theorem is useful because allows you to find a remainder when dividing a really big number by a prime number.
https://www.mathacademytutorin....g.com/blog/modular-a
Like
Comment
Share
