🔢 mathematics

Jacob's ladders, point of contact of the remainder in the prime-number law with the Fermat-Wiles theorem and multiplicative puzzles on some sets of integrals

Assuming the Riemann hypothesis, this paper proves the existence of specific increments to the Ingham integral that generate new functionals and corresponding equivalents of the Fermat-Wiles theorem, alongside other related results.

Original authors: Jan Moser

Published 2026-01-22

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Jan Moser

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Picture: Connecting Three Giant Puzzles

Imagine the world of mathematics as a massive, ancient library. In this library, there are three famous, difficult puzzles that have been sitting on the shelves for over a century:

The Prime Number Puzzle: How are prime numbers (2, 3, 5, 7, 11...) distributed? They seem random, but there is a hidden pattern.
The Riemann Hypothesis: A famous guess about where the "ghosts" of these numbers hide. If this guess is true, it unlocks the secrets of the primes.
Fermat's Last Theorem: A rule that says you can't build a specific type of pyramid out of whole numbers (like $x^n + y^n = z^n$ ) if the height is 3 or more. This was proven long ago, but mathematicians love finding new ways to describe why it's true.

The Author's Claim:
Jan Moser claims to have built a special "ladder" (which he calls Jacob's Ladder) that connects these three puzzles. He argues that if you assume the Riemann Hypothesis is true, you can create a new mathematical bridge that links the behavior of prime numbers directly to Fermat's Last Theorem.

The Tools: The "Ladder" and the "Echo"

To understand how he does this, we need to look at his two main tools:

1. Jacob's Ladder (The Elevator)
Imagine you are standing on a number line. Usually, you walk step-by-step (1, 2, 3...). But Moser uses a special "elevator" called Jacob's Ladder.

Instead of walking, this elevator jumps to new heights based on a complex formula involving the Riemann Zeta function (a machine that analyzes the primes).
The paper describes how these jumps create a series of "steps" that get further and further apart, similar to how galaxies move away from each other in an expanding universe. These steps allow him to look at the numbers from a very specific, zoomed-out perspective.

2. The "Echo" of the Primes (The Remainder)
When mathematicians try to count prime numbers, they use a formula that is almost perfect but has a tiny "error" or "remainder" (let's call it $P(t)$ ).

Moser focuses on the negative of this error ( $-P(t)$ ).
He treats this error like a sound wave. Just as a sound wave bounces off a wall and creates an echo, Moser shows that if you integrate (add up) this error over specific distances defined by his "Ladder," it creates a perfect "echo" that matches the distribution of prime numbers.

The Main Discovery: The "Multiplicative Puzzle"

The most creative part of the paper is what Moser calls a "Multiplicative Puzzle."

Imagine you have a giant, heavy box (an integral of the prime number error). You want to know how heavy it is.

The Old Way: You try to weigh the whole box at once.
Moser's Way: He shows that you can break this heavy box into smaller, lighter boxes.
The Magic: He proves that the weight of the big box is exactly equal to the product (multiplication) of the weights of several smaller boxes.
The Catch: These smaller boxes aren't just random; they are made of the "squared strength" of the Riemann Zeta function (the machine that checks the primes).

He gives a specific example where one big calculation is equal to the multiplication of four smaller calculations, each shifted by a tiny bit (like $e^0$ , $e^1$ , $e^{1.5}$ , etc.). It's like saying: "The total volume of a room is exactly equal to the volume of four specific smaller rooms multiplied together."

The "Fermat" Connection

The paper claims that this new way of looking at numbers creates a "test" for Fermat's Last Theorem.

Moser suggests that if you take a specific type of number (a "Fermat rational," which is a fraction made from Fermat's equation) and run it through his "Ladder" and "Echo" machine, the result will never equal 1.
If the result did equal 1, it would break the rules of Fermat's theorem. Since the result is never 1, it acts as a new mathematical proof (or "equivalent") of why Fermat's theorem holds true.

Summary of the "Contact Point"

The author describes his work as a "5-fold point of contact." Imagine five different roads meeting at a single intersection:

The Riemann Zeta Function (The machine).
The Riemann Hypothesis (The assumption that the machine works correctly).
The Prime Number Law (The traffic flow).
Jacob's Ladders (The special bridges).
Fermat's Last Theorem (The destination).

Moser claims that by standing on his "Ladder" and assuming the Riemann Hypothesis is true, he can see all five of these concepts interacting in a new, surprising way. He shows that the "error" in counting primes, when viewed through his ladder, behaves exactly like the rules that govern Fermat's theorem.

Important Note

The paper is purely theoretical. It does not claim to solve any real-world engineering problems, medical issues, or financial models. It is a "pure math" exploration, trying to find hidden symmetries and connections between abstract number theories. The author is essentially saying, "If you look at these numbers through this specific lens, they reveal a beautiful, hidden pattern that links these three famous mathematical mysteries together."

Technical Summary: Jacob's Ladders, Point of Contact of the Remainder in the Prime-Number Law with the Fermat-Wiles Theorem and Multiplicative Puzzles on Some Sets of Integrals

Problem Statement
The paper investigates the asymptotic behavior of the remainder term $P(t)$ in the prime-number law, defined by $\pi(t) = \text{li}(t) + P(t)$ . While Littlewood (1914) established that $P(t)$ changes sign infinitely often, Ingham (1932) proved that, assuming the Riemann Hypothesis (RH), the integral of $P(t)$ is negative in the mean for sufficiently large $Y$ . The central problem addressed is the existence of specific increments of the Ingham integral that generate new functionals. The author seeks to establish a "point of contact" linking five distinct mathematical domains: the Riemann zeta-function, the Riemann Hypothesis, the prime-number law, "Jacob's ladders" (a specific iterative structure), and the Fermat-Wiles theorem.

Methodology
The methodology relies on the theory of "Jacob's ladders," denoted as $\phi_1(T)$ , and their direct and reverse iterations, $\phi^k_1(t)$ and $\phi^{-k}_1(t)$ . These iterations generate a sequence of points $\{T, \frac{1}{T}, \dots, \frac{k}{T}\}$ which, under the author's framework, exhibit asymptotic properties analogous to an expanding universe.

Key methodological steps include:

Iterative Partitioning: Using reverse iterations $\phi^{-r}_1(T)$ to partition the integration domain of the Hardy-Littlewood integral $\int |\zeta(\frac{1}{2}+it)|^2 dt$ and the Ingham integral $\int P(t) dt$ into asymptotically equidistant segments.
Asymptotic Mapping: Establishing relationships between the negative remainder $-P(t)$ and the prime-counting function $\pi(t)$ via specific parametric integrals involving the function $N(\delta)$ , which is derived from the Ingham integral's behavior.
Functional Construction: Constructing limits of products of integrals involving $-P(t)$ and $|\zeta(\frac{1}{2}+it)|^2$ over intervals defined by Jacob's ladders.
Multiplicative Decomposition: Utilizing partitions of integers and logarithmic scales ( $\ln^k T$ ) to decompose complex integrals into products of simpler integrals, creating "multiplicative puzzles."

Key Contributions and Results

New Functionals and $P_\zeta$ -Equivalents:
The paper proves that, on the Riemann Hypothesis, there exist increments of the Ingham integral that generate new functionals. Specifically, Theorem 2 establishes a limit functional where the product of an integral of $-P(t)$ and an integral of $|\zeta(\frac{1}{2}+it)|^2$ converges to a fixed value $x$ .

A significant contribution is the derivation of a $P_\zeta$ -equivalent of the Fermat-Wiles theorem. By applying the derived functional to Fermat's rationals ( $x = \frac{x^n+y^n}{z^n}$ ), the author posits that the condition:
$\lim_{\tau \to \infty} \frac{1}{\tau} \left( \int \dots \times \int \dots \right) \neq 1$
on the set of all Fermat's rationals constitutes a new equivalent formulation of the theorem.
Asymptotic Factorization Formulas:
The paper derives asymptotic factorization formulas linking the Ingham integral and the Hardy-Littlewood integral. For instance, Theorem 7 presents:
$\int_{T}^{[T]_1} |\zeta(\tfrac{1}{2}+it)|^2 dt \sim \int_{N_1(T)}^{N_1([T]_1)} \{-P(t)\} dt \times \int_{[T]_1}^{[T + \frac{1}{a}]_1} |\zeta(\tfrac{1}{2}+it)|^2 dt$
This suggests a structural decomposition where the integral of the squared modulus of the zeta-function can be factored into a product involving the remainder of the prime-number law.
Interaction between $-P(t)$ and $|\zeta|^2$ :
The paper introduces a new double integral (Theorem 5, Corollary 2) over a region $Q_2(T)$ defined by Jacob's ladders, showing that:
$\iint_{Q_2(T)} \{-P(u)\} |\zeta(\tfrac{1}{2}+iv)|^2 du dv \sim (1-c)T$
This is described as a "new type of interaction" between the prime-number remainder and the zeta-function on the critical line.
Multiplicative Puzzles:
The author presents "multiplicative puzzles" where an integral of $-P(t)$ over a domain defined by $\ln^k T$ is asymptotically equivalent to the product of $k$ integrals of $|\zeta(\frac{1}{2}+it)|^2$ . Theorem 9 demonstrates that for a fixed $k$ , there exists a continuum of solutions (vectors of parameters) such that the product of these integrals approximates the target integral.

Significance and Claims
The paper claims to identify a "5-fold point of contact" between the Riemann zeta-function, the Riemann Hypothesis, the prime-number law, Jacob's ladders, and the Fermat-Wiles theorem. The author asserts that the derived $P_\zeta$ -conditions provide a novel analytical framework for viewing the Fermat-Wiles theorem through the lens of analytic number theory and integral asymptotics.

The work is presented as a theoretical exploration of asymptotic behaviors under the assumption of the Riemann Hypothesis. The author explicitly states that the results are conditional on the RH and are derived using the specific machinery of Jacob's ladders developed in previous works. The paper does not propose experimental applications or future computational proposals but focuses on establishing these theoretical equivalences and factorization formulas.