scholarly journals Diophantine Triples and k-Generalized Fibonacci Sequences

2016 ◽  
Vol 41 (3) ◽  
pp. 1449-1465 ◽  
Author(s):  
Clemens Fuchs ◽  
Christoph Hutle ◽  
Florian Luca ◽  
László Szalay
2015 ◽  
Vol 34 (6) ◽  
pp. 1262-1269 ◽  
Author(s):  
Stefan Wundrak ◽  
Jan Paul ◽  
Johannes Ulrici ◽  
Erich Hell ◽  
Volker Rasche

2016 ◽  
Vol 56 (4) ◽  
pp. 503-517 ◽  
Author(s):  
Carlos Alexis Gómez Ruiz ◽  
Florian Luca

Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 700 ◽  
Author(s):  
Pavel Trojovský

The k-generalized Fibonacci sequence ( F n ( k ) ) n (sometimes also called k-bonacci or k-step Fibonacci sequence), with k ≥ 2 , is defined by the values 0 , 0 , … , 0 , 1 of starting k its terms and such way that each term afterwards is the sum of the k preceding terms. This paper is devoted to the proof of the fact that the Diophantine equation F m ( k ) = m t , with t > 1 and m > k + 1 , has only solutions F 12 ( 2 ) = 12 2 and F 9 ( 3 ) = 9 2 .


2013 ◽  
Vol 2013 (1) ◽  
pp. 26 ◽  
Author(s):  
Hee Kim ◽  
J Neggers ◽  
Keum So

Sign in / Sign up

Export Citation Format

Share Document