Search arXivSearch

arXiv · 2609.09214

The Diophantine equation $p^{x}+6^{y}=z^{2n}$: a complete solution for half of the primes

Abstract

Let $p$ be a prime number and let $n\geq 1$ be an integer. We completely solve the exponential Diophantine equation $p^{x}+6^{y}=z^{2n}$ in positive integers $x,y,z$ for every prime $p$ such that the Legendre symbol $\leg{6}{p}$ equals $-1$, that is, for $p\equiv 7,11,13,17\pmod{24}$: the equation has no solution, with the single exception $(p,n,x,y,z)=(13,1,1,2,7)$. Since these residue classes contain half of all primes in the sense of Dirichlet density, this settles the equation for one prime out of two, uniformly in the exponent $n$. Two ingredients of the proof have independent interest. First, we show that the Ramanujan--Nagell type equation $p^{x}=2\cdot 6^{m}+1$ has no solution with $x\geq 2$, using Zsigmondy's theorem on primitive prime divisors; this removes the extra congruence hypotheses that appeared in earlier work of the author on the case $n=1$ and solves the open problems formulated there. Secondly, we prove that $13^{x}+6^{y}=z^{2}$ has $(x,y,z)=(1,2,7)$ as its unique solution, thereby completely resolving the exceptional prime. The Legendre condition is sharp: we exhibit solutions for primes with $\leg{6}{p}=+1$ realising each branch of the factorisation argument. All results are corroborated by extensive computational verification, and we state several open problems, including the complete classification of the solutions when $\leg{6}{p}=+1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pagdame Tiebekabe. 2026-09-06. The Diophantine equation $p^{x}+6^{y}=z^{2n}$: a complete solution for half of the primes. https://arxiv.org/abs/2609.09214

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The new Fermat-type factorization algorithm

Let n be any odd natural number other than a perfect square. We show that the new factorization algorithm, presented in this paper and which we call DFM-1 (where DFM stands for Detto's Factorization Method), is much more efficient than the implementation technique of Fermat's Factorization Algorithm (FFA) called FFA-1, which, among the implementation techniques of Fermat's Factorization Algorithm (FFA), is the one that requires the fewest iterations to identify the non-trivial and trivial factors of n (excluding the cases in which the two factors of the pair of non-trivial or trivial factors of n are so close to each other that they can be identified at the 1st iteration with each of such implementation techniques). Indeed, by the way in which Euler's totient function of any n that is a semiprime is applied to FFA-1, we arrive at the new factorization algorithm (DFM-1), which halves (possibly rounding up to the next integer) the number of iterations required by FFA-1. Furthermore, in this paper, we present the hypothetical scenario according to which the number of iterations could possibly be further reduced. Finally, and still in relation to this new factorization algorithm, in this paper we present the limit number of iterations, which is less than the number of iterations required by DFM-1 to reach the condition x - y = 1 which characterizes the pair of trivial factors of n, beyond which it is no longer possible for pairs of non-trivial factors of n to occur.

math.GM

A Note on the Measure of Vector and Pythagorean Theorem

Why the square? We present a geometry-axiom-free derivation of the Pythagorean theorem and the square at its core, establishing their algebraic origin from within the bare vector-space framework. Such concepts as the (right) angle, rotation, inner product, orthogonality etc also emerge as a logical construct rather than taken as given. They are necessitated by the square, and the ensuing theory, in turn, $\textit{canonically}$ stems from a $\textit{single}$ definitional primitive $-$ the ($\mathbb R^{\vcenter{\hbox{$\scriptscriptstyle+$}}}\!$-quantitative) invariant $\mathcal Q$-measure of a vector. This provides the core of an algebraic justification for Euclidean geometry. Equally important, these findings account (also canonically) for the complex modulus-squared $p = |\mathfrak a|^2$ $-$ the quantum Born rule $-$ and point out what is even admissible for being quantitatively interpreted. The linear structure and its endomorphisms are rigid in the sense that the $\textit{well-defined}$ interpretable turns out to be, up to gauge $\mathcal Q {\,\to\,} \mathrm{const} {\,\vcenter{\hbox{$\scriptstyle\times$}}\,} \mathcal Q$, the unique gauge-invariant measure $\mathcal Q=|\hspace{-0.18em}| {\cdot}{\cdot}{\cdot} |\hspace{-0.18em}|^2$; independently of the field $\mathbb R$ or $\mathbb C$.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. Liu proposed the conjecture \[ \sum_{\text{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \ge 2+\left(\frac{2r}{R}\right)^k,\qquad k>1, \] with the reverse inequality for $k<1$. We prove this conjecture by reducing it to an algebraic inequality for three positive variables with prescribed sum and product. We also determine the equality cases.

math.GM