The strange story of an almost unknown prime number counter: The Rafael Barrett formula

This brief article presents and analyzes Rafael Barrett's 1903 formula for counting prime numbers, which remained obscure until its rediscovery and publication in Montevideo in 1935.

The Gist

Imagine you've just stumbled upon a secret recipe for counting prime numbers, but the chef who wrote it down was actually a famous essayist, not a mathematician. That's the heart of this paper.

Here is the story of the "Rafael Barrett Formula," explained simply:

1. The Unlikely Chef: Rafael Barrett

First, let's meet the man behind the math. Rafael Barrett wasn't a professor in a lab coat; he was a writer and essayist, a "man of letters" with a golden pen. Born in Spain but living in South America (mostly Paraguay and Uruguay), he was deeply moved by the poverty and tragedy of the Paraguayan people. He wrote beautifully about politics and life.

But hidden in his past was a secret hobby: he loved math. In 1903, he wrote a letter to Henri Poincaré, one of the most famous mathematicians in the world at the time. In this letter, Barrett didn't just ask a question; he handed over a mathematical machine he had built to count prime numbers.

2. The Lost Treasure

For decades, this letter sat in the shadows, unknown to the world. It wasn't until the 1930s that a Uruguayan mathematician named Eduardo García de Zúñiga (think of him as the "grandfather" of math in Uruguay) found it. He realized that Barrett had created a formula that could count how many prime numbers exist below any given number.

García de Zúñiga published Barrett's work in 1935, bringing this "lost treasure" to light.

3. The Magic Machine (The Formula)

So, what does Barrett's machine do?

Imagine you have a giant jar of marbles, and you want to count only the "special" ones (the prime numbers: 2, 3, 5, 7, 11, etc.).

• If you ask the machine, "How many special marbles are there up to number 10?" it says 5.
• If you ask, "Up to number 13?" it says 6.

Barrett's formula is a complex-looking equation involving factorials (multiplying numbers like 1×2×3...) and sine waves (the wiggly lines you see in sound waves). It sounds like gibberish, but it works like a perfect filter. It uses a famous rule called Wilson's Theorem (which is like a secret handshake that only prime numbers know) to filter out the non-primes and count the real ones.

The paper shows that if you plug in a number, the formula spits out the exact count of primes below it. It's a "prime number counter" that works perfectly, even though it looks incredibly complicated.

4. The Big Mystery: The "Speed Limit" of Math

Here is where the story gets interesting.

Mathematicians have known for a long time that as you count higher and higher, the "density" of prime numbers follows a smooth, predictable curve (called the Prime Number Theorem). It's like knowing that if you drive far enough, the average speed of cars on the highway settles into a specific pattern.

The paper asks a fascinating question: Can we use Barrett's complicated, wiggly machine to figure out that smooth, predictable pattern?

It's like asking: "If I have a very complex, noisy engine (Barrett's formula), can I tune it just right to hear the perfect, smooth hum of the universe (the Prime Number Theorem)?"

The author suggests that while Barrett's formula implies this smooth pattern exists, actually getting from the messy formula to the clean answer might be impossible without a clever trick or a "heuristic" (a smart guess). The paper ends by challenging readers: Can anyone find a clever shortcut to turn Barrett's complex machine into the simple, elegant truth of the Prime Number Theorem?

Summary

• The Hero: A famous essayist named Rafael Barrett who secretly invented a math formula.
• The Discovery: The formula was lost for 30 years until a mathematician found it in a letter to a legend.
• The Tool: A complex equation that counts prime numbers perfectly using a "secret handshake" rule.
• The Challenge: Can we use this complex tool to easily prove the big, smooth rule that governs how prime numbers are distributed?

It's a story about how math and literature can collide, and how a single letter from a writer might hold a key to one of the universe's deepest secrets.

Technical Summary

1. Problem Statement

The paper addresses a historical gap in the documentation of a specific mathematical formula related to the prime number counter (the function $\pi(n)$, which counts the number of primes less than or equal to $n$).

• The Core Object: A formula for counting prime numbers, allegedly created by the writer and essayist Rafael Barrett in a 1903 letter to the renowned mathematician Henri Poincaré.
• The Mystery: Despite Barrett's fame as a literary figure, his mathematical contribution remained obscure for decades. It was only brought to light in the 1930s by Uruguayan mathematician Eduardo García de Zúñiga, who analyzed the formula in a 1935 journal publication.
• The Theoretical Challenge: The paper poses a specific mathematical question: Can the Prime Number Theorem (the asymptotic limit $\pi(n) \sim \frac{n}{\ln n}$) be derived directly from Barrett's explicit, finite summation formula using heuristic methods?

2. Methodology

The author employs a historical-mathematical analysis combining biographical research with rigorous mathematical verification:

• Historical Reconstruction: The paper traces the provenance of the formula from Barrett's 1903 correspondence to its rediscovery by García de Zúñiga in 1935. It clarifies the context of Barrett's life (a Spanish-born writer in Paraguay and Uruguay) and the academic environment of early 20th-century Uruguay.
• Mathematical Derivation:
  • The paper presents Barrett's formula explicitly.
  • It establishes the theoretical foundation of the formula based on Wilson's Theorem ($p$ is prime $\iff (p-1)! \equiv -1 \pmod p$).
  • The author provides a new proof of Barrett's formula in the Appendix (referenced in the text), demonstrating how the trigonometric summation correctly identifies prime numbers.
• Comparative Analysis: The paper contrasts Barrett's discrete, exact counting method with the continuous, asymptotic approach of the Prime Number Theorem (proven by Hadamard and de la Vallée Poussin in 1896).
• Heuristic Exploration: The author references the "statistical method" approach found in Courant and Robbins' What is Mathematics?, which derives the Prime Number Theorem using approximations (Stirling's formula and Legendre's theorem), to frame the challenge of deriving the limit from Barrett's formula.

3. Key Contributions

• Documentation of Barrett's Formula: The paper formally introduces and analyzes the correct formula:
  $$\text{Barr}(n) = 3 + \sum_{k=5}^{n-1} \frac{\sin\left(\frac{(k-1)!\pi}{k}\right)}{\sin\left(\frac{\pi}{k}\right)}$$
  (Note: The formula relies on Wilson's Theorem. When $k$ is prime, $(k-1)! \equiv -1 \pmod k$, causing the numerator to become $\sin(-\pi/k) = -\sin(\pi/k)$, resulting in a term value of $-1$. The summation logic is structured such that these terms effectively filter the count, while the leading constant 3 accounts for the primes 2 and 3, which are excluded from the summation range starting at $k=5$.)
• Historical Attribution: It clarifies that while Barrett was known as a "homme de lettres," he possessed significant mathematical insight, contributing a valid (though computationally inefficient) exact formula for $\pi(n)$.
• Validation of García de Zúñiga's Work: It reaffirms the contribution of Eduardo García de Zúñiga, the "father" of the Uruguayan mathematical community, who first recognized and published the analysis of Barrett's work.
• Formulation of a New Conjecture: The paper concludes by posing an open problem: Is there an "ingenious heuristic" capable of extracting the asymptotic limit $\lim_{n \to \infty} \frac{\text{Barr}(n) \ln n}{n} = 1$ directly from Barrett's complex trigonometric summation?

4. Results

• Verification of the Formula: The paper confirms that Barrett's formula correctly counts prime numbers for integer inputs (e.g., $\text{Barr}(6)=4$, $\text{Barr}(12)=6$), functioning as an exact prime counter.
• Theoretical Link: It successfully links the formula to Wilson's Theorem, showing that the factorial term in the sine argument serves as the mechanism to distinguish primes from composites.
• Limitation Identified: While the formula is exact for finite $n$, the paper highlights the difficulty of transitioning from this discrete, unbounded summation to the continuous asymptotic limit ($\frac{n}{\ln n}$). The author suggests that while the limit is theoretically implied, accessing it directly from Barrett's formula via standard heuristics may be "impossible" or requires a novel approach.

5. Significance

• Interdisciplinary Bridge: The paper serves as a unique intersection between literature and mathematics, highlighting how a celebrated essayist (Barrett) made a genuine contribution to number theory that was lost to history.
• Historical Preservation: It rescues a specific piece of mathematical history from obscurity, documenting the intellectual exchange between South American scholars and European giants like Poincaré.
• Mathematical Insight: By presenting a new proof and analyzing the formula's structure, the paper adds to the understanding of how Wilson's Theorem can be encoded into summation formulas.
• Open Research Direction: The paper challenges the mathematical community to find a heuristic derivation that connects this specific discrete counter to the Prime Number Theorem, potentially offering new perspectives on the distribution of prime numbers.