A note on the diophantine equation {k\choose 2}-1=q^n+1

DOI10.4064/CM-76-1-31-34MaRDI QIDQ4386259zbMATH OpenOpenAlexFDO

Authors Le Maohua

Publication date 25 March 1999

Published in Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/210550

zbMATH Keywords

coding theoryestimates of linear forms in logarithmsexponential diophantine equationsupper bounds

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

Recommendations

• A note on the Diophantine equation \(x^2 + q^m = c^{2n}\)
• A NOTE ON THE DIOPHANTINE EQUATION
• scientific article; zbMATH DE number 5036182
• scientific article; zbMATH DE number 1134639
• A note on the diophantine equation \((a^n-1)(b^n-1)= x^2\)
• On the Diophantine equation \(x^2+q^{2k+1}=y^n\)
• Publication:4890963
• A note on the Diophantine equation \(x^{2}+(2c-1)^{m}=c^{n}\)
• Note on the Diophantine equation \(1+2p+(2p)^2+\dots+(2p)^n=y^p\)
• A note on the diophantine equation \(ax^ m - by^ n = k\)

Cited in

(2)

• Binomial coefficients and Lucas sequences
• scientific article; zbMATH DE number 278889 (Why is no real title available?)

This page was built for publication: A note on the diophantine equation ${k\choose 2}-1=q^n+1$

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