Fibonacci numbers at most one away from a perfect power

From MaRDI portal
Publication:952007

DOI10.4171/EM/89zbMath1156.11008OpenAlexW1997058156MaRDI QIDQ952007

Samir Siksek, Florian Luca, Maurice Mignotte, Yann Bugeaud

Publication date: 5 November 2008

Published in: Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL: http://www.ems-ph.org/journals/show_pdf.php?issn=0013-6018&vol=63&iss=2&rank=1




Related Items (32)

Fibonacci length and the generalized order k-Pell sequences of the 2-generator p-groups of nilpotency class 2Fermat and Mersenne numbers in \(k\)-Pell sequenceTerms of generalized Fibonacci sequences that are powers of their ordersPOWERS OF THREE AS DIFFERENCE OF TWO FIBONACCI NUMBERS\(k\)-Fibonacci powers as sums of powers of some fixed primesFibonacci and Lucas numbers of the form \(2^a+3^b+5^c\)On Fibonacci numbers which are elliptic CarmichaelCombinatorial constructions for the Zeckendorf sum of digits of polynomial valuesOn Fibonacci numbers as sum of powers of two consecutive tribonacci numbersShifted powers in binary recurrence sequencesSums of Fibonacci numbers that are perfect powersBalancing and balancing-like numbers which are one away from perfect powersGeneralized Fibonacci numbers of the form \(wx^2 + 1\)On the nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\)Generalized Fibonacci numbers of the form \(2^a + 3^b + 5^c\)On the l.c.m. of shifted Fibonacci numbersPERFECT POWERS THAT ARE SUMS OF TWO POWERS OF FIBONACCI NUMBERSDiophantine approximationOn perfect powers that are sums of two Fibonacci numbersLinear combinations of prime powers in sums of terms of binary recurrence sequencesTwo \(b\)-repunits in the Fibonacci sequenceThe Fibonacci version of the Brocard-Ramanujan Diophantine equationAn exponential Diophantine equation related to powers of two consecutive Fibonacci numbersDiophantine equations involving the Euler totient functionUnnamed ItemOn the exponential Diophantine equation \(F_{n+1}^x - F_{n-1}^x = F_m\)The Diophantine equation Fn = P(x)Shifted powers in Lucas-Lehmer sequencesUnnamed ItemUpper bounds for solutions of an exponential Diophantine equationOn a Diophantine equation involving Fibonacci numbers and the Ramanujan \(\tau\)-function of factorialsOn the exponential Diophantine equation Fnx ± Fmx = a with a ∈{Fr,Lr}


Uses Software


Cites Work


This page was built for publication: Fibonacci numbers at most one away from a perfect power