Answers are grounded in this paper and cite their sources.
The Beal conjecture asserts that if Aˣ+Bʸ=Cᶻ with positive integers $A,B,C$ andexponents x,y,z≥ 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≥ 5, which all have the form 6k±1.We prove an exact counting formula and a parametrization (an ``orbit'') for thecongruence Bʸ≡ Cᶻ Aˣ 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≤ A≤ 21,a study of gaps between coprime perfect powers up to 10⁹, and two ``orbit-lifting'' searches forA a prime or a product of two primes ≥ 5 with B up to 2×10⁶ and 4×10⁶.No coprime solution is found. In the lifting searches, gaps divisible by Aˣ are plentiful, but thecofactor (Cᶻ-Bʸ)/Aˣ 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.
No takes yet. Share an insight, caveat, or question.
C. Tantisukarom (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: