Editing Number Theory (section)

== <span style="color: #FFFFFF;">Understanding</span> ==
Number theory operates at several levels, from elementary divisibility to deep analytic and algebraic methods:

'''Primality and its mysteries''': The primes are the atoms of the integers — every integer factors uniquely into primes. Yet the primes themselves resist simple description. Euclid proved there are infinitely many (classic proof: assume finitely many; multiply them all together and add 1; the result has a prime factor not in the list — contradiction). But the distribution of primes is irregular: the Prime Number Theorem (proved 1896) states that the number of primes ≤ n is approximately n/ln(n). The Riemann Hypothesis gives a more precise description of this distribution.

'''Modular arithmetic and its power''': Modular arithmetic structures integer arithmetic by focusing on remainders. Chinese Remainder Theorem (CRT): if m₁, m₂, ... are pairwise coprime, the system x ≡ aᵢ (mod mᵢ) has a unique solution mod m₁m₂.... Fermat's Little Theorem (a^(p-1) ≡ 1 mod p for prime p) is central to primality testing and RSA encryption. Quadratic residues (which numbers are perfect squares mod p?) lead to the law of quadratic reciprocity — one of Gauss's crowning achievements.

'''Diophantine equations''': The quest for integer solutions to polynomial equations. Pythagorean triples (x² + y² = z²) have infinitely many solutions (3,4,5), (5,12,13), etc., parameterized by Euclid's formula. Pell's equation (x² − Dy² = 1) has infinitely many solutions for non-square D. Fermat's Last Theorem (x^n + y^n = z^n, n > 2) has no solutions — Wiles' proof involved deep connections to elliptic curves and modular forms.

'''Connections to cryptography''': Modern public-key cryptography (RSA, Diffie-Hellman, elliptic curve cryptography) is built entirely on number-theoretic foundations. RSA security rests on the apparent computational hardness of factoring large integers — despite anyone being able to multiply them together easily. This asymmetry between easy multiplication and hard factoring is a fundamental number-theoretic phenomenon.
</div>

<div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">