Bounds on the number of squares in recurrence sequences
From MaRDI portal
Publication:6613267
DOI10.1016/J.JNT.2024.05.002MaRDI QIDQ6613267
Publication date: 2 October 2024
Published in: Journal of Number Theory (Search for Journal in Brave)
Measures of irrationality and of transcendence (11J82) Cubic and quartic Diophantine equations (11D25) Exponential Diophantine equations (11D61) Approximation to algebraic numbers (11J68)
Cites Work
- On divisors of Lucas and Lehmer numbers
- Complete solution of the diophantine equation \(X^ 2+1=dY^ 4\) and a related family of quartic Thue equations
- Thue's fundamental theorem. II: Further refinements and examples
- On the representation of integers by binary cubic forms of positive discriminant
- The Magma algebra system. I: The user language
- The zero multiplicity of linear recurrence sequences
- Über einige Anwendungen diophantischer Approximationen.
- Improved constants for effective irrationality measures from hypergeometric functions
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Die Gleichung \(ax^n-by^n=c\)
- Thue's Fundamentaltheorem, I: The general case
- The Diophantine equation aX 4 – bY 2 = 1
- Rational Approximations to Certain Algebraic Numbers
- On the Diophantine Equation $Ax^4-By^2=C$, ($C=1,4$).
- RATIONAL APPROXIMATIONS TO 23 AND OTHER ALGEBRAIC NUMBERS
This page was built for publication: Bounds on the number of squares in recurrence sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613267)
