Skip to content
number theory
5 articles · All tags
- The Fibonacci Sequence and the Golden Ratio Explained
Each Fibonacci number is the sum of the previous two, and their ratio approaches the golden ratio, about 1.618. See the math, the history, and the myths. - Prime Numbers and the Sieve of Eratosthenes
A prime has exactly two divisors, 1 and itself. Learn why primes never run out, how the ancient Sieve of Eratosthenes finds them, and why they secure the internet. - Euler's Totient Function
The function φ(n) counting the integers between 1 and n that are coprime to n, a cornerstone of modular arithmetic and the basis of RSA encryption. - Fundamental Theorem of Arithmetic
The theorem that every integer greater than 1 factors uniquely into primes, up to the order of the factors. - Riemann Zeta Function
A complex function central to analytic number theory; the location of its zeros encodes the distribution of the prime numbers.