The spanning method and the Lehmer totient problem

This paper introduces the "spanning method" for analyzing integer functions and applies it to the Lehmer totient problem to establish a lower bound on the number of integers $n$ satisfying the equation $t\phi(n)+1=n$ for some natural number $t$.

The Gist

Here is an explanation of the paper "The Spanning Method and the Lehmer Totient Problem" using simple language, everyday analogies, and creative metaphors.

The Big Mystery: The Lehmer Totient Problem

Imagine you have a special machine called the Euler Totient Machine (denoted as $\phi$). If you feed it a number, it counts how many smaller numbers "get along" with it (mathematically, how many are coprime).

• If you feed it a prime number (like 7), the machine says "6" (because 1, 2, 3, 4, 5, and 6 all get along with 7).
• If you feed it a composite number (like 8), the machine says "4" (because 1, 3, 5, and 7 get along with 8).

The Mystery: In 1932, a mathematician named Lehmer asked a tricky question:

"Is there a composite number (a number made of smaller parts) where the machine's output divides the number minus one?"

In math speak: Does $\phi(n)$ divide $(n-1)$ for any composite $n$?

• For primes, this is easy: $\phi(7) = 6$, and 6 divides $7-1$. It works perfectly.
• For composites, no one has ever found an example. But no one has proven it's impossible either. It's like looking for a unicorn in a forest; we haven't seen one, but we haven't proven they don't exist.

The New Tool: The "Spanning Method"

The author, Theophilus Agama, introduces a new way of thinking called the Spanning Method.

The Analogy: The Jumping Jacks
Imagine a line of people (numbers) standing in a row. You want to find people who can "jump" to a specific spot using a specific rule.
The rule is: $t \times \text{MachineOutput} + \text{Constant} = \text{Person's Number}$.

• If you can find a person who fits this jump, they are "spanned."
• The author wants to see how many people in the line can make this jump.

The Problem with the Old Machine:
The Euler Totient Machine only works for whole numbers (integers). It's like a digital clock that only ticks at 1:00, 2:00, 3:00. It jumps. It doesn't flow. This makes it hard to use advanced math tools (calculus) that require smooth, continuous movement.

The Magic Trick: The "Fractional Totient"

To fix the "jumping" problem, the author invents a Fractional Totient Invariant Function (let's call it $\tilde{\phi}$).

The Analogy: The Smooth Ramp
Imagine the digital clock again. Instead of just ticking, the author builds a ramp between the numbers.

• At 1:00, the ramp is at height 1.
• At 1:59, the ramp is slightly higher.
• At 2:00, it hits the next integer value.

This new function is "smooth" (continuous) enough to let the author use calculus (specifically, integration by parts) to measure the "weight" or "volume" of the numbers that fit the jump rule. It's like turning a bumpy dirt path into a smooth highway so a race car (the math proof) can drive fast.

The Discovery: Counting the Unicorns

Using this smooth ramp and the Spanning Method, the author does the following:

1. Counts the Jumpers: They calculate a lower bound (a minimum guarantee) for how many numbers up to a huge size $s$ can make the jump.
2. The Formula: They prove that the number of these "jumpers" is roughly:
   $$\frac{s}{2 \log s} \times (\text{a bunch of prime factors})$$
   This means there are a lot of numbers that fit the pattern.
3. The Contradiction: Here is the clever part. The author says:
   • "If there are no composite numbers that fit the rule, then all these 'jumpers' must be prime numbers."
   • But, we know from the Prime Number Theorem (a famous rule about how primes are distributed) that there aren't that many primes.
   • The author's calculation shows there are more jumpers than there are primes available to fill the spots.
   • Conclusion: Since there are too many jumpers to be just primes, some of them must be composite numbers.

The Verdict

The paper argues that yes, a composite number satisfying Lehmer's condition must exist.

The Metaphor:
Imagine you are trying to fill a bucket with water.

• You know the bucket can only hold 10 gallons (the limit of how many primes exist).
• Your new method (the Spanning Method) proves that you are pouring in 15 gallons of water (the count of numbers fitting the rule).
• Since you can't fit 15 gallons into a 10-gallon bucket, the extra 5 gallons must be something else (composite numbers).

Why This Matters

This paper doesn't just say "it exists"; it provides a new toolkit (the Spanning Method) and a new smooth function ($\tilde{\phi}$) that mathematicians can use to solve other similar hard problems. It turns a jagged, discrete puzzle into a smooth, continuous one, allowing the heavy machinery of calculus to solve a number theory mystery.

In short: The author built a smooth ramp over a bumpy number line, used it to count how many numbers fit a specific pattern, and proved that the count is so high that some of them have to be the elusive composite numbers we've been looking for.

Technical Summary

Based on the provided paper, here is a detailed technical summary of "The Spanning Method and the Lehmer Totient Problem" by Theophilus Agama.

1. Problem Statement

The paper addresses the Lehmer Totient Problem, posed by D.H. Lehmer in 1932. The central question is:

Does there exist a composite integer $n$ such that $\phi(n) \mid (n - 1)$?

Here, $\phi$ denotes the Euler totient function. While it is trivial for prime numbers (since $\phi(p) = p-1$), no composite solution has ever been found. Extensive partial results (by Cohen, Hagis, Luca, and Pomerance) have established that if such a composite $n$ exists, it must be:

• Odd and square-free.
• Possess a very large number of distinct prime factors (at least 14, and potentially hundreds of thousands depending on divisibility by 3).
• Extremely large ($n > 10^{20}$, with tighter bounds for specific cases).

The paper aims to prove the existence of at least one such composite integer using a novel analytic-combinatorial approach.

2. Methodology: The Spanning Method

The core innovation of the paper is the introduction of the "Spanning Method," which transforms a multiplicative number theory problem into an additive-analytic one.

A. The Spanning Concept

The authors define a set of integers "spanned" by a function $f: \mathbb{N} \to \mathbb{R}$. An integer $n$ is said to be $k$-step spanned along $f$ with multiplicity $t$ if it satisfies the equation:
$$t f(n) + k = n$$
For the Lehmer problem, the authors focus on the case where $f = \phi$, $k = 1$, and $t \in \mathbb{N}$. The condition $\phi(n) \mid (n-1)$ is equivalent to the existence of an integer $t$ such that $t\phi(n) + 1 = n$. The goal is to estimate the size of the set $S_1(\phi, s) = \{n \le s \mid \exists t \in \mathbb{N}, t\phi(n) + 1 = n\}$.

B. The Fractional Totient Invariant Function ($\tilde{\phi}$)

A major technical hurdle is that the Euler totient function $\phi(n)$ is defined only on integers and is discontinuous, making standard analytic tools (like integration by parts) inapplicable. To overcome this, the authors define a continuous extension:
$$\tilde{\phi}(a) := \phi(\lfloor a \rfloor) + \{a\}$$
where $\lfloor a \rfloor$ is the floor function and $\{a\}$ is the fractional part.

• Properties: $\tilde{\phi}$ coincides with $\phi$ on integers. Crucially, it is right-continuous, has bounded variation on intervals $[x, x+1)$, and possesses left limits.
• Significance: These properties allow $\tilde{\phi}$ to be treated as a càdlàg (continue à droite, limite à gauche) function, enabling the use of Stieltjes-Lebesgue integration.

C. The Spanning Inequality

Using Stieltjes integration by parts, the authors derive a fundamental inequality relating the count of spanned integers to the sum of the function values. Let $M_f(s, k)$ be the $s$-level measure (partial sum of $f(n)$ for spanned $n$). The Spanning Inequality (Proposition 4.3) states:
$$|S_k(f, s)| \ge \frac{1}{f(s)} \sum_{n \in S_k(f), n \le s} f(n) + \frac{f(1)|S_k(f, 1)|}{f(s)}$$
This inequality provides a lower bound for the number of solutions based on the cumulative sum of the function values.

3. Key Results and Proofs

A. Lower Bound for the Counting Function (Lemma 6.1)

By applying the Spanning Inequality to $\tilde{\phi}$ and utilizing classical number-theoretic estimates (Prime Number Theorem, Mertens' Formula, and sharp bounds on prime sums), the authors derive an explicit lower bound for the number of integers $n \le s$ satisfying the condition:
$$\#\{n \le s \mid t\phi(n) + 1 = n, \text{ for some } t \in \mathbb{N}\} \ge \frac{s}{2 \log s} \prod_{p \mid \lfloor s \rfloor} \left(1 - \frac{1}{p}\right)^{-1} - \frac{3}{2}e^\gamma$$
where $\gamma$ is the Euler-Mascheroni constant.

This bound quantifies how prime numbers (where $\phi(p)=p-1$) contribute to the set of solutions and how the multiplicative structure of $\phi$ influences the count.

B. Proof of Existence of a Composite Solution (Theorem 6.2)

The authors proceed by contradiction to prove the existence of a composite solution:

1. Assumption: Assume no composite $n$ exists such that $\phi(n) \mid (n-1)$.
2. Implication: Under this assumption, all solutions to $t\phi(n)+1=n$ must be prime numbers. Therefore, the count of solutions is bounded above by the prime counting function $\pi(s)$.
3. Contradiction:
   • The derived lower bound (Lemma 6.1) grows roughly as $\frac{s}{\log s} \times C$, where the product term over primes dividing $s$ can be made arbitrarily large by choosing $s$ to be a product of many small primes.
   • Specifically, for a specific infinite set of composite numbers $C$ (products of primes), the term $\prod (1-1/p)^{-1}$ exceeds 3.
   • This forces the lower bound for the solution count to exceed $\frac{3}{2} \frac{s}{\log s}$.
   • However, the Prime Number Theorem states $\pi(s) \sim \frac{s}{\log s}$.
   • The derived lower bound eventually exceeds the actual number of primes $\pi(s)$, creating a contradiction.
4. Conclusion: The assumption is false; therefore, there exists at least one composite integer $n$ such that $\phi(n) \mid (n-1)$.

4. Key Contributions

1. The Spanning Viewpoint: Recasting the divisibility condition $\phi(n) \mid (n-1)$ as membership in a "spanned set" allows the application of additive-analytic tools (Stieltjes integration) to a purely multiplicative problem.
2. Fractional Totient Extension: The construction of $\tilde{\phi}$ provides the minimal regularity (right-continuity, bounded variation) required to apply integration techniques while preserving the arithmetic integrity of the totient function.
3. Quantitative Synthesis: The paper successfully synthesizes sharp inequalities for prime sums (e.g., Axler's bounds), Mertens' formula, and the Prime Number Theorem to produce a concrete, usable lower bound for the counting function of spanned integers.

5. Significance

• Resolution of a Long-Standing Open Problem: The paper claims to prove the existence of a composite solution to the Lehmer Totient Problem, a question that has remained open since 1932.
• Methodological Innovation: The "Spanning Method" offers a new framework for analyzing arithmetic functions. By extending discrete functions to continuous analogs with specific regularity properties, it opens the door to applying measure-theoretic and integration techniques to problems traditionally solved via sieve methods or elementary number theory.
• Structural Insight: The proof highlights the tension between the density of primes and the multiplicative structure of the totient function, suggesting that the "gap" between the number of primes and the number of potential solutions to the Lehmer equation must be filled by composite numbers.

Note on Context

The paper is dated March 12, 2026, and appears on arXiv with a "math.GM" (General Mathematics) tag. While the mathematical derivation follows a logical structure using established theorems (PNT, Mertens), the claim of solving the Lehmer problem is a significant assertion that would require rigorous peer review and verification by the broader mathematical community, as the problem has resisted solution for nearly a century. The proof relies on the specific construction of the set $C$ and the behavior of the product term $\prod (1-1/p)^{-1}$ to force the contradiction.