Near-squares in binary recurrence sequences

DOI10.1142/S1793042124500787MaRDI QIDQ6562934zbMATH OpenFDO

Authors Nikos Tzanakis, Paul Voutier

Publication date 27 June 2024

Published in International Journal of Number Theory (Search for Journal in Brave)

zbMATH Keywords

recurrence sequencesquartic Diophantine equations

Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

Recommendations

• Near squares in linear recurrence sequences
• scientific article; zbMATH DE number 1182976
• scientific article; zbMATH DE number 1355191
• Bounds on the number of squares in recurrence sequences
• scientific article; zbMATH DE number 4164952

Cites work

• scientific article; zbMATH DE number 4210225 (Why is no real title available?)
• scientific article; zbMATH DE number 3979149 (Why is no real title available?)
• scientific article; zbMATH DE number 4033820 (Why is no real title available?)
• scientific article; zbMATH DE number 1522558 (Why is no real title available?)
• scientific article; zbMATH DE number 870559 (Why is no real title available?)
• scientific article; zbMATH DE number 3204780 (Why is no real title available?)
• scientific article; zbMATH DE number 3300651 (Why is no real title available?)
• scientific article; zbMATH DE number 3185064 (Why is no real title available?)
• scientific article; zbMATH DE number 3030231 (Why is no real title available?)
• scientific article; zbMATH DE number 3089206 (Why is no real title available?)
• A simple method for solving the Diophantine equation \(Y^2=X^4+aX^3+bX^2+cX+d\)
• Aurifeuillian factorization
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• Computing integral points on elliptic curves
• Eight Diophantine Equations
• Five Diophantine Equations.
• On Computing Factors of Cyclotomic Polynomials
• On Square Fibonacci Numbers
• On squares in certain Lucas sequences
• On the Diophantine Equation $Ax^4-By^2=C$, ($C=1,4$).
• Solving a family of Thue equations with an application to the equation x²-Dy⁴=1
• Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms
• Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms. The case of quartic equations
• Solving the Pell equation
• Squares in Lehmer sequences and the Diophantine equation Ax⁴-By²=2
• The Diophantine equation $b^2X^4-dY^2=1$
• The Diophantine equation aX 4 – bY 2 = 1
• The Diophantine equation x⁴ - Dy² = 1, II
• The Magma algebra system. I: The user language
• The square terms in Lucas sequences

This page was built for publication: Near-squares in binary recurrence sequences

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