The atoms of arithmetic — primes are the building blocks of all integers.
A prime p > 1 has exactly two divisors: 1 and itself. The first primes: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, …
Primes are the foundation of modern cryptography and connect deeply to factoring in algebra.
cKdPywNp/i0bPnVMd+9qv/ReGBLD2YQc1HsI5zoW7P0J6g355WHxLAWJBl1tSIulSvSB0ZztnlBqFK8cgA9qe7ZJSwrExo8bIbsM7Gih2u5eU+40MvZz5vEMFA9PInjlrc7NevxbQJKWyavZlUm4t4nyjwpCfzZtuIau8LcsL2OEtOUGAArQtic1XMZEkp+xBpZjIVQwgGKOhZ/RAVJBIOFE3e6+fFY57O8k6JmddVK1LuXT3s1TYcsBPJPDkskk8YlzDcsXdmTbHnbFDSRrbKqWMTV2ztT8S1WSgK60HPaxQJkG5aOj8pg3qKDT7sH6svygunza4bjK3BvKsNuoH8nfD0wWFF2k0ov/GqvpVjWwcwHISMFW4IggqNrstUDOv740K4CCt14DIfNZXOvjwkhL1btodc87GjjM57V7s9kCO5gFbbTIvao7SK9RSWqGLsKRggBim848bTG7rFXfVRDtqpVHctbQu5GmhnsVh89CGNaU5pjlM0OePqdnmhwl83NZtVGACzZ5ySy11vHJ1o1mlqnRPxTdOFg7S+U4zTuNrA5e7na0QYcWxkgJCpZteglr1z7CuwjD5830ksYS0XBz9QFdgdu9+fk7x9jxLJcxL5mBQ/k3iJPiwYDDyotEtiCOTut6wBCLj1OOWnHZ24ESxqVIqvKKQxeNMO6Rr0/m4SlBQRYILdR4stnB2eB7hDBJadHyXl7JQbidqQY+4tdrOJKPMaKXGh1qCN3frGN18rzhTuxWS360 ÷ 2 = 180 → 180 ÷ 2 = 90 → 90 ÷ 2 = 45 → 45 ÷ 3 = 15 → 15 ÷ 3 = 5 → 5 ÷ 5 = 1
ljNSjX5MHIjoZs7wQh01zO+Ts2gCpZK+8A090l6BBWNHq9eJhGDerGiMp0Mlx9vNCCQAa+Qs4NTRrwsjrKpjaKDndu3MDISn6LUEwzDozE4k4tVfMGBEGazy5d6lRbPHynsUY6R14p6gsWec8kh/ooQIVvfV0UHSOm5z6ojDBRulZafk49xZvyus02kUz5nIMnmJgum9ASxL+Oo+ny0ckRv/MeCW+NHCrEa6gik3mwFtd5D1KxiOiGLiYDAMznRo7DYJvyD4Ac6wU34xIRnxusWI8XHX+vKUw2WF9HJAh05nF9fPCs+vlacruHGEl+jcceb9B0zmk7JL58/tri2rnrzQLH6cF6URN3ZGrWVPS4EvYFyNjxV0htC46khxIf90ZGYNy0DzjxRisyMZ2RLKStrjzUexsY/Lv+AtK+lZnrPBdCAE4niw2PWuSpOenTGrwlXh+PMwqilKMMstbXiD9FQoDssQNAvb9xKnndt5mlFY39XDwIJPISHWdxGnQmjO3bDlwCXnty/HNx0+BScfAvogMkeelxVon2O71H7AcGvzj5w9HWOQtcIryhqAspsH6TS4uN5lAjCETeAV+E32SFqkK+QkxQ/G9P35Y3ky0O8AH/wj88gKsx1F/uKH/xn2YXRqV9Y4PPg1Q2WrJbEfquH9TfGf1q3BTx3VBm4SyeH5ngMG2ZXacPgCQ0TGU/stZapaeGLPNYGkYnW6W134aPa/eM2g1jDfVlNMyu4q3mzJldf/i7rAFDivisors of 360: (3+1)(2+1)(1+1) = 24 divisors
Euclidean Algorithm computes GCD efficiently: GCD(a, b) = GCD(b, a mod b). This is one of the oldest algorithms — and it's essential in modular arithmetic for finding modular inverses.
To find all primes ≤ n: start with 2, mark all multiples of 2, next unmarked (3), mark all multiples of 3, continue to √n. The remaining unmarked numbers are prime. Complexity: O(n log log n).
The Prime Number Theorem: π(n) ≈ n/ln(n), where π(n) counts primes ≤ n. This connects primes to logarithmic functions and limits. There are infinitely many primes (Euclid's proof by contradiction is one of the most elegant in mathematics).
Open problems: the Twin Prime Conjecture (infinitely many primes p where p+2 is also prime), Goldbach's Conjecture (every even n > 2 is the sum of two primes), and the Riemann Hypothesis (about the precise distribution of primes).
YzNb00bqTzt/k+wcHCbvzr8k2P/97mzxHg88mHyux4WFT0Qd/KL/4MAwQACuJYgavSjuIFqJ3OnB8JFJicdfB55ikVskKKt1Pynhusz7UummGmP1r2OiI4lf3TRADQmtFjbf/h8OsGXTrpAwTrF76slP/350wE3eJGjozM5S8VypTAVCHVM8cqMjL1w2GavpCUQKC1PDJJxZ05PnbtbBR1VAK/pxDhwUAghk2Gav4IKb0bnH2YFB5+y0Otnn+p2T5pgBN6dnslVg0PUcRbfRa3q7/fJtcHhNWfB+AeYJ2apTiFCs356n5uWjU0x3k+fGf3tho63678YY5p1r/GP/eLU2flshGtAOspYdfTAn23VjX+MSgps/n262aCookSf60H0wELsMk1VcoZKk84QPqPOa7cj4aHzsW23QxRKPEdovRftcUQdkWRn+3+9xvh1sTdkYfA12AG2/QldJKW7Dnf1R9hnWzhXt5QW7c17lHQRLVxKeVHIX2OKWqHlrELKjc4E1a7Tx0pR2wKscZnAG0+ZcLv30INDU0cyff9BdPJNgxXTOuB/kgp4tSOE+O2rWpJQAghpQPAX/41wvFbzF4PoI21xqcOKo60GTcWRVGEMmPuKwQI6SxRoZnWdwoxcdXD93v1s8XhgIExrnA4TdXMD1bISFLVU4ahXG8S8C1w+tRR/MWP7OlqtZNHBk/XuBwfSy8gIPp20XWINrshsOfSlwbJJGm1PjNh34heFnEt+7bKAvU2AIrz BdhaCuOV7FGNr+ZqdysSdT0yWH+8YYe8ELfjwMvYNaRjnTNuMCO9AKhKerg5mXXS4C1vL+gB1KeS0wvuj6IT2jXayzc+l6yoCCUhmv/rD9z3wqs6EeAJB5/3/1nfdyGkREngJecrNtNXYb/jsjrQhmjEYUavON1omwuxrOqmSvdSUu0tzuwG3s/RVx6L+v6lUS2fIc2t9XRrYfKS64mhJUbz8ICHTeMpgYNFa1X65tDnASPJxx5vlxkpdP/w7O7zbQmOLFK9EsXN/BZYtQk0Jqx1Sn+WAToLGF8KDDpZQWOftYZNLr0oPoNKerg5u8P8LPeHddOypyyYF4Dks0bRy2lmNtOJ3n3kESgNSvRP2bO2ZHI5TCr0+LsNUX4iH0rUX2Zln5BY+2UwLbRTsmehjI93hR4ZOy/EdxKxbD0Lnahpt9mYGNkzRf5ktQevtLcFERgjyYcF/yz5MHtI+FDGep8FNj9Uj0fYCYVtI7OxR014T3JGr/aVvSanXqZXRKlXEjKgL7qMNyspZ7/jenPqypZyCUmN2Jghrwshmae0KalZDHnYlG/ACBRpZPamNEOr+LiIOleB3aaSHehF1B9gZlYmS+2Kzvu2coNm6fZP4RD2jDfxdSn655LTC+7t6kgpmkRN4VQhABOOdlY5dpZAyYj7Zo/yH0QVa2FuA0Hi0fZT9jmMLHBSyvu0ufzxkKa0toDyetZtMX4l0wsgjvZYdYNOAErfvYbi+1463vxd/rPdjPkaI8kSa