Category: Recreational Math

  • Prime Numbers: The Atomic Architects of Mathematics

    It has been said that mathematics is the king of the sciences, number theory is the queen of mathematics, and prime numbers are the heart of number theory. I will leave the application of the transitivity property—from prime numbers to the sciences—to you; I have a strong suspicion it holds true.

    This blog is intended to entice discussion around recreational math, and contributions on the subject are welcome. While these articles will not always carry the academic rigor of organizations like the AMS, the MAA, or a university mathematics department, they will deal strictly with proven mathematical facts. There are more than enough curiosities in the world of numbers to awaken our collective interest.

    The Fundamental Building Blocks

    Primes live up to their reputation by acting as the “atoms” of the integers—and by extension, the complex numbers (specifically the Gaussian integers). Primes generate the integers via the Fundamental Theorem of Arithmetic. From integers, rational numbers are formed; the union of rational and irrational numbers forms the real numbers; and by adding ii, the imaginary unit, we reach the plane of complex numbers.

    Despite centuries of study, primes remain a profound mystery. Let us dive into a few observations.

    Observation 1: The 6k±16k \pm 1 Rule

    All prime numbers greater than or equal to 5 can be expressed in the form:

    6k±1, where k6k \pm 1, \text{ where } k \in \mathbb{N}

    Note: The converse is false. The first counterexample occurs at k=4k = 4,

    64+1=256 \cdot 4 + 1 = 25 (composite), though 641=236 \cdot 4 – 1 = 23 (prime).

    Why is this true?

    Every integer can be expressed as 6k+r6k + r, where the remainder, r{0,1,2,3,4,5}r \in \{0, 1, 2, 3, 4, 5\}.

    • 6k,6k+26k, 6k+2 and 6k+46k+4 are always divisible by 2.
    • 6k+36k+3 is always divisible by 3.

    This leaves only 6k+16k+1 and 6k+56k+5 (which is equivalent to 6k16k – 1 in modular arithmetic) as potential candidates for primes greater than 3.

    Observation 2: Primes and Modulo 24

    If pp is a prime and p5p \geq 5, then:

    p21(mod24)p^2 \equiv 1 \pmod{24}

    In plain English, 24 always divides p21p^2 – 1. Why 24? We can factor the expression as:

    p21=(p1)(p+1)p^2 – 1 = (p – 1)(p + 1)

    Since pp is an odd prime, (p1)(p – 1) and (p+1)(p + 1) are consecutive even numbers. One must be a multiple of 2 and the other a multiple of 4, making their product divisible by 8. Furthermore, in any sequence of three consecutive integers (p1,p,p+1)(p-1, p, p+1), one must be a multiple of 3. Since pp is a prime greater than 3, it cannot be that multiple; therefore, either (p1)(p-1) or (p+1)(p+1) must be.

    Since the product is divisible by both 8 and 3, it is necessarily divisible by 8×3=248 \times 3 = 24.

    A conclusion from these two observations is that they are necessary, but not sufficient conditions for primality.

    Observation 3: The Divergence of Prime Reciprocals

    The sum of the reciprocals of all natural numbers (the Harmonic series) diverges:

    n=11n=\sum_{n=1}^{\infty} \frac{1}{n} = \infty

    Interestingly, the sum of the squares of reciprocals converges (the famous Basel Problem):

    n=11n2=π26\sum_{n=1}^{\infty} \frac{1}{n^2} = \frac{\pi^2}{6}

    Leonhard Euler demonstrated a beautiful connection between primes and the Zeta function through the Euler Product Formula:

    ζ(s)=n=11ns=p11ps for s,s>1\zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s} = \prod_{p \in \mathbb{P}} \frac{1}{1 – p^{-s}} \text{ for } s \in \mathbb{R}, s \gt 1

    While the sum of the squares converges, the sum of the reciprocals of primes does not:

    p1p=\sum_{p \in \mathbb{P}} \frac{1}{p} = \infty

    Even though primes become increasingly rare as we move up the number line, they occur frequently enough that their reciprocal sum approaches infinity. However, this series diverges incredibly slowly; it is estimated that it would take roughly ee100e^{e^{100}} terms for the sum to even reach 100!

    Conclusion

    I hope these curiosities have awakened your enthusiasm for mathematical discussion. In future posts, I will dive into the Riemann Hypothesis and other enduring mysteries. Until then, stay curious and visit the Prime Pages!

    Credits: This post was prepared with comments from José Jaime Saldarriaga and accuracy checks from Gemini.