The diagonalization method and Brocard's problem

This paper introduces a diagonalization method for functions from natural numbers to real numbers and applies it to prove that the equation $\Gamma_r(n) + k = m^2$ has only a finite number of solutions for any fixed natural numbers $k$ and $r$.

The Gist

Imagine you are a detective trying to solve a very old, very stubborn mystery. The mystery is called Brocard's Problem.

The Old Mystery: The Factorial Puzzle

For over a century, mathematicians have been asking a simple question:

"If you take a number, multiply it by every number smaller than it (this is called a factorial, written as $n!$), add 1, and see if the result is a perfect square (like 4, 9, 16, 25), how many times does this happen?"

For example:

• $4! + 1 = 24 + 1 = 25$(Which is$5^2$. Yes!)
• $5! + 1 = 120 + 1 = 121$(Which is$11^2$. Yes!)
• $7! + 1 = 5040 + 1 = 5041$(Which is$71^2$. Yes!)

But after checking millions of numbers, no one has found any more. The big question is: Are there only these three, or does the pattern continue forever?

The New Detective: The "Truncated" Approach

The author of this paper, Theophilus Agama, decided to tackle a slightly different version of the mystery. Instead of multiplying everything down to 1 (like $n!$), he decided to stop the multiplication early.

Imagine you are building a tower out of blocks.

• The Old Way (Factorial): You stack blocks from the top all the way to the ground.
• The New Way (Truncated Gamma): You only stack the top few blocks. You ignore the bottom ones.

Mathematically, this is called $\Gamma_r(n)$. It's like taking the factorial and saying, "Okay, stop multiplying after $r$ steps."

The author asks: "If we use this shorter tower, add a small number ($k$), and check if it's a perfect square, will we find a finite number of solutions, or will they go on forever?"

The Secret Weapon: The "Diagonalization" Method

To solve this, the author invented a new detective tool called Diagonalization.

Here is the analogy:
Imagine you have a long, winding road (the number line). You are looking for specific "treasure spots" where a magic condition is met (where the number plus $k$ becomes a perfect square).

1. The Map (The Trace): Instead of checking every single spot one by one, the author draws a "trace" or a shadow of the road. He calculates the "weight" of all the treasure spots found so far.
2. The Balance Scale (The Inequality): He puts this weight on a giant balance scale. On the other side, he puts a "control weight" based on how fast the road is growing and how "smooth" it is.
   • If the road grows too fast or too wildly, the scale tips, and the math says: "There can't be too many treasure spots."
   • If the scale balances in a specific way, it proves that the treasure spots must eventually run out.

The Big Discovery

The author applied this "Diagonalization" tool to the "Truncated" towers.

He proved that for any fixed "stop point" ($r$) and any fixed "add-on number" ($k$), the equation $\Gamma_r(n) + k = m^2$ can only have a finite number of solutions.

In plain English:
Even though the numbers get huge, the "Truncated" towers grow so predictably and smoothly that the "perfect square" condition can only happen a limited number of times. Eventually, the numbers get so big and spread out that they simply stop hitting the perfect square targets.

Why This Matters

• It's Unconditional: Most previous attempts to solve Brocard's problem relied on big, unproven guesses (conjectures). This paper proves the result for the truncated version using only solid, standard math (calculus and inequalities).
• It's a New Toolkit: The author didn't just solve one equation; he built a new "detective kit" (the diagonalization method). This kit can be used to solve other similar puzzles where numbers grow in a predictable, polynomial way.

The Bottom Line

The paper says: "We can't quite solve the original, super-hard Brocard problem yet. But, if we look at a slightly simpler version where we stop the multiplication early, we can prove with 100% certainty that the answers are finite. And we did it using a clever new way of looking at the numbers, like balancing a scale."

Technical Summary

Based on the provided paper, here is a detailed technical summary of "On a Variant of Brocard's Problem via the Diagonalization Method" by Theophilus Agama.

1. Problem Statement

The paper addresses a variant of the classical Brocard's Problem, which seeks integer solutions to the Diophantine equation:
$$n! + 1 = m^2$$
While only three small solutions are known ($n=4, 5, 7$), the finiteness of the solution set remains unproven unconditionally (though conditional results exist under the $abc$ conjecture).

The author generalizes this problem by replacing the factorial function $n!$ with the $r$-th truncated Gamma function, denoted as $\Gamma_r(n)$. For a fixed integer $r \geq 0$, this function is defined as:
$$\Gamma_r(n) = \begin{cases} n(n-1)\cdots(n-r) & \text{if } n > r \\ 0 & \text{if } n \leq r \end{cases}$$
The paper investigates the Diophantine equation:
$$\Gamma_r(n) + k = m^2$$
where $k$ and $r$ are fixed natural numbers. The primary objective is to prove that for any fixed pair $(r, k)$, there are only finitely many integer solutions $n > r$.

2. Methodology: The Diagonalization Method

The core contribution of the paper is the development and application of a new analytic framework called the Diagonalization Method. This approach shifts the problem from pure number theory to a variational-analytic setting involving traces and inequalities.

Key Definitions

• $k$-step Diagonal ($D_k(f)$): The set of integers $n$ such that $f(n) + k$ is a perfect square.
• $s$-level Trace ($T_f(s, k)$): The partial sum of the function values over the diagonal set up to $s$:
  $$T_f(s, k) = \sum_{\substack{n \leq s \\ n \in D_k(f)}} f(n)$$
• Stieltjes Representation: The author expresses the trace as a Stieltjes integral to relate pointwise counts to aggregate quantities:
  $$T_f(s, k) = f(s)|D_k(f, s)| - \int_1^s f'(t)|D_k(f, t)| \, dt$$
  where $|D_k(f, s)|$ is the count of solutions up to $s$.

The Diagonal Inequality (Theorem 2.3)

By applying the Cauchy-Schwarz inequality to the integral representation, the author derives a critical inequality bounding the $L^2$-norm of the diagonal count. The inequality relates the cumulative count of solutions to the growth of the function $f$ and its derivative $f'$.

The method establishes a sufficient condition for finiteness: If the function $f$ grows sufficiently fast relative to its derivative, the set of solutions must be finite. Specifically, if the limit:
$$\lim_{s \to \infty} \left( \frac{1}{f(s)} \sum_{n \leq s} f(n) \right) \left( 1 - \frac{1}{f(s)} \sqrt{\int_1^s |f'(t)|^2 dt} \right)^{-1} < \infty$$
holds, then $|D_k(f)|$ is finite.

3. Key Contributions

1. Unconditional Finiteness: Unlike previous results on Brocard-type problems which often rely on deep conjectures (like the $abc$ conjecture), this paper provides an unconditional proof of finiteness for the truncated Gamma variant.
2. New Analytic Framework: The introduction of the "diagonalization method" offers a toolkit for studying Diophantine equations of the form $f(n) + k = m^2$ where $f$ is a polynomially growing function. It converts the discrete problem of finding squares into a continuous problem of estimating integrals and norms.
3. Explicit Growth Analysis: The paper explicitly calculates the asymptotic behavior of $\Gamma_r(n)$ and its derivative to satisfy the diagonal inequality conditions.

4. Main Results

Theorem 4.1 (Variational Brocard):
For fixed integers $r \geq 0$ and $k \geq 1$, the equation $\Gamma_r(n) + k = m^2$ has a finite number of solutions for $n \in \mathbb{N}$ with $n > r$.

Proof Sketch:

• Growth Rate: The truncated Gamma function behaves asymptotically as $\Gamma_r(n) \asymp n^{r+1}$.
• Derivative Estimate: The integral of the squared derivative is estimated as $\int_1^s |\Gamma_r'(t)|^2 dt \asymp s^{2r+1}$.
• Verification: By substituting these estimates into the Diagonal Inequality, the author shows that the ratio of the sum of values to the function value at $s$ converges, and the derivative term is controlled. This satisfies the sufficient condition for the set of solutions to be finite.

5. Significance and Implications

• Alternative to Modular/Algebraic Approaches: Traditional approaches to Brocard's problem often involve embedding factorials into modular arithmetic or algebraic geometry. This paper introduces a variational-analytic viewpoint, suggesting that the "smoothness" and "growth rate" of the function are the primary drivers of solution finiteness.
• Generalizability: The method is not limited to $\Gamma_r$. The author notes that it can be adapted to any arithmetic function with controlled polynomial growth and smoothness, providing a potential pathway to solve other shifted square problems.
• Limitations: While the method proves finiteness for the truncated product, the paper acknowledges that applying it directly to the full factorial $n!$ (where $r \to \infty$) requires verifying the conditions for $f(n) = n!$. The paper suggests this as a direction for future work but does not claim to have solved the original Brocard problem ($n!+1=m^2$) unconditionally in this specific text, though it frames the original problem as a limit case of the generalized framework.

In summary, Theophilus Agama introduces a novel analytic technique to prove that replacing the factorial with a truncated product in Brocard's equation results in a finite set of solutions, independent of unproven conjectures.