Near-squares in binary recurrence sequences

DOI10.1142/S1793042124500787zbMATH Open1548.11068MaRDI QIDQ6562934FDOQ6562934

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)

Cites Work

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

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)