Fermat and Mersenne numbers in \(k\)-Pell sequence

DOI10.30970/ms.56.2.115-123zbMath1496.11028OpenAlexW4200236666MaRDI QIDQ2126882

Salah Eddine Rihane, Alain S. Togbé, Benedict Vasco Normenyo

Publication date: 19 April 2022

Published in: Matematychni Studiï (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.30970/ms.56.2.115-123

zbMATH Keywords

Fermat numberreduction algorithmFibonacci numberlinear form in logarithmsMersenne number\(k\)-Pell number

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fibonacci numbers at most one away from a perfect power
• Coincidence between \(k\)-Fibonacci numbers and products of two Fermat numbers
• Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
• The generalized Binet formula, representation and sums of the generalized order-\(k\) Pell numbers
• The Binet formula, sums and representations of generalized Fibonacci \(p\)-numbers
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
• On a generalization of the Pell sequence
• Repdigits in generalized Pell sequences
• On The diophantine equationFn+F_m=2^a
• Powers of two as sums of two k-Fibonacci numbers
• THE EQUATIONS 3x²−2 = y² AND 8x²−7 = z²

This page was built for publication: Fermat and Mersenne numbers in \(k\)-Pell sequence