MCA
NUMBER THEORY // PRIMES // MODULAR ARITHMETIC // CRYPTOGRAPHY // RSA // FERMAT // EULER'S THEOREM // NUMBER THEORY //
BACK TO MATH HUB
hard

Number Theory

Primes, modular arithmetic, and cryptography

PRIMES_&_MOD

The Power of Primes

Numbers with only two divisors. The fundamental building blocks of integers.

2, 3, 5, 7, 11, 13, 17, 19, 23...

Modular Arithmetic (mod)

"Clock arithmetic". Foundational for cyclic structures and encryption algorithms like RSA.

a ≡ b (mod n)

RSA_ENCRYPTION

SECRET

c = m^e (mod n)

The backbone of internet security.

CRYPTO_KIT

Euclidean Algo

Finding Greatest Common Divisor (GCD).

Chinese Remainder

Solving systems of congruences.

Fermat's Theorem

Basics of cyclic subgroups.

Prime Factorization

Hard problem keeping data secure.