Abstract:This paper proposes an analytical and structural reformulation of the classical Brocard Problem. Through modular reduction using primorial cycles, the study establishes that the global solution space is governed by a structural invariant tightly restricted to pairs of consecutive $n$-smooth integers. The work mathematically proves the Triangular Equivalence, demonstrating that the existence of a Brown number is strictly equivalent to the condition that one-eighth of the factorial of $n$ is a perfect triangular number. Additionally, based on the profound structural tension and $p$-adic density imbalances, the manuscript introduces a generative $p$-Adic Sieve algorithm. This computational innovation shifts the traditional search from continuous floating-point extractions to discrete combinatorial partitions, identifying the potential for polynomial-time approximations via Lenstra--Lenstra--Lovász (LLL) lattice reduction. Finally, utilizing the Dickman-de Bruijn function and structural mapping to the Erdős-Selfridge Theorem, the research asymptotically justifies the extreme geometric rarity of the solutions and demonstrates the universality of the methodological framework by establishing recursive reductions for even shifts and immediately invalidating the generalized equation $n! + 3 = m^2$ for any $n \ge 4$.
From: Leandro Vieira Peixoto [view email]
[v1]
Mon, 22 Jun 2026 15:30:46 UTC (19 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。