Prime Factors $\ge 5$ and the Beal Equation: A Structural and Computational Study

The Beal conjecture asserts that if $A^x+B^y=C^z$ with positive integers $A,B,C$ andexponents $x,y,z\ge 3$, then $A$, $B$, $C$ share a common prime factor.We study a hypothetical coprime solution by separating the primes $2$ and $3$(``the factor $6$'') from the primes $p\ge 5$, which all have the form $6k\pm1$.We prove an exact counting formula and a parametrization (an ``orbit'') for thecongruence $B^y\equiv C^z \pmod{A^x}$ that every coprime solution must satisfy, and weshow that this local condition is always satisfiable and multiplicative across the primes of $A$.We then report four computational experiments: an exhaustive search for $5\le A\le 21$,a study of gaps between coprime perfect powers up to $10^9$, and two ``orbit-lifting'' searches for$A$ a prime or a product of two primes $\ge 5$ with $B$ up to $2\times10^6$ and $4\times10^6$.No coprime solution is found. In the lifting searches, gaps divisible by $A^x$ are plentiful, but thecofactor $(C^z-B^y)/A^x$ behaves like a random integer and never approaches $1$.We conclude that the obstruction is global, not local, and we state the limits of the evidence.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24235244
Primary Topic
Algebraic Geometry and Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Prime Factors $\ge 5$ and the Beal Equation: A Structural and Computational Study

C. Tantisukarom
Zenodo (CERN European Organization for Nuclear Research)
Algebraic Geometry and Number Theory
preprint

Prime Factors $\ge 5$ and the Beal Equation: A Structural and Computational Study

C. Tantisukarom
preprint en

Abstract

The Beal conjecture asserts that if $A^x+B^y=C^z$ with positive integers $A,B,C$ andexponents $x,y,z\ge 3$, then $A$, $B$, $C$ share a common prime factor.We study a hypothetical coprime solution by separating the primes $2$ and $3$(``the factor $6$'') from the primes $p\ge 5$, which all have the form $6k\pm1$.We prove an exact counting formula and a parametrization (an ``orbit'') for thecongruence $B^y\equiv C^z \pmod{A^x}$ that every coprime solution must satisfy, and weshow that this local condition is always satisfiable and multiplicative across the primes of $A$.We then report four computational experiments: an exhaustive search for $5\le A\le 21$,a study of gaps between coprime perfect powers up to $10^9$, and two ``orbit-lifting'' searches for$A$ a prime or a product of two primes $\ge 5$ with $B$ up to $2\times10^6$ and $4\times10^6$.No coprime solution is found. In the lifting searches, gaps divisible by $A^x$ are plentiful, but thecofactor $(C^z-B^y)/A^x$ behaves like a random integer and never approaches $1$.We conclude that the obstruction is global, not local, and we state the limits of the evidence.

Zenodo (CERN European Organization for Nuclear Research)
Algebraic Geometry and Number Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon