Mathematics

Limits and number-theory sketch

Limits, continuity, primes, congruences.

Basics

Limits and continuity

If f(x)→L as x→a, values near a sit near L. Continuity: the limit equals f(a). Divergence or oscillation means no limit. ε–δ is the precise language.

Integers

A prime has no positive divisors but 1 and itself. Fundamental theorem: prime factorization is unique. a≡b (mod n) means n divides a−b. This underpins crypto and hashes.

Formulas

Euclidean algorithm

gcd(a, b) = gcd(b, a mod b)

Greatest common divisor. Extended form gives ax+by=gcd.

Modular arithmetic

a ≡ b (mod n) ⇔ n | (a − b)

Clock arithmetic. Addition and multiplication respect the modulus.

In this field