A surprising amount of number theory is the art of replacing a hard problem with several easy ones, provided the easy ones can be recombined without loss. The Chinese Remainder Theorem (CRT) is the cleanest example of that philosophy. It says that, under the right hypothesis, working “mod $n$” is the same as working independently […]

Number theory often asks for solutions that are stable under increasing precision. If a congruence has a solution modulo $p$, does it lift \to a solution modulo $p^2$, then $p^3$, and so on? This question is not a technical curiosity; it is the doorway \to a local view of arithmetic. The $p$-adic numbers package “all […]

Prime numbers feel irregular in the small and remarkably lawlike in the large. The Prime Number Theorem (PNT) is the precise expression of that law: it identifies the dominant growth rate of the prime-counting function and explains, indirectly, why every attempt to predict primes by a simple closed formula runs into oscillations. The theorem is […]

Most “first theorems” in number theory arrive with a glow of inevitability. Fermat’s little theorem is a classic example: if $p$ is prime and $a$ is not a multiple of $p$, then $a^{p-1} \equiv 1 \pmod p$. It is short, memorable, and immediately useful. The theorem is also the first place many people accidentally learn […]

Quadratic reciprocity is one of the first theorems in number theory that feels like a genuine rule of the landscape rather than a local trick. It tells you how solvability of $x^2 \equiv p \pmod q$ relates to solvability of $x^2 \equiv q \pmod p$, where $p$ and $q$ are odd primes. Once you have […]

Number theory is often presented as a subject of exact statements about integers. Computation feels almost too practical: machines use finite memory, approximate real numbers, and must stop after a finite number of steps. Why should computation belong \to a subject where the objects are infinite and exact? The answer is that many of the […]