•  
  •  
 

Turkish Journal of Mathematics

Abstract

Suppose that $c$, $m$, and $a$ are positive integers with $a \equiv 11,\,13 \pmod{24}$. In this work, we prove that when $2c+1=a^{2}$, the Diophantine equation in the title has only solution $(x, y, z)=(1,1,2)$ where $m \equiv \pm 1 \pmod{a}$ and $m>a^2$ in positive integers. The main tools of the proofs are elementary methods and Baker's theory.

DOI

10.3906/mat-1803-14

Keywords

Exponential Diophantine equation, Jacobi symbol, lower bound for linear forms in logarithms

First Page

2690

Last Page

2698

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 9
  • Usage
    • Downloads: 124
    • Abstract Views: 77
  • Captures
    • Readers: 2
see details

Included in

Mathematics Commons

Share

COinS