On the Diophantine equation 3²ⁿ - 2 3ᵐ+ 1 = k^2

From MaRDI portal
Publication:2889960





In this paper the authors completely solve the Diophantine equation \(3^{2n} - 2 \cdot 3^m+ 1 = k^2\). They prove that the only solution is \((n,m,k)=(n,n,3^n-1)\). To obtain the result they show that the Diophantine equation \(x^2+C=3^{2n}\) has at most one solution in positive integers \(x\) and \(n\). The proof of this latter result is based on the identity \((3^n-x)(3^n+x)=C\).











This page was built for publication: On the Diophantine equation \(3^{2n} - 2 \cdot 3^m+ 1 = k^2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889960)