Indexed metadata

On the Diophantine equation X2+pm=p1n1p2n2X^2+p^m=p_1^{n_1}p_2^{n_2}

Amir Ghadermarzi

Source record

Source: arXiv

Published: Oct 14, 2026

arXiv: 2610.20930

Open original source ↗

Source abstract

We consider the Diophantine equation X2+pm=p1n1p2n2, X^2+p^m=p_1^{n_1}p_2^{n_2}, where p,p1,p2p,p_1,p_2 are distinct odd primes. Using factorizations in quadratic fields, sharp bounds for linear forms in two pp-adic logarithms, elementary methods, and known results on exponential Diophantine equations, we obtain explicit bounds for m,n1,n2m,n_1,n_2, and consequently the finiteness of the number of solutions for fixed p,p1,p2p,p_1,p_2.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.