On a Diophantine equation involving powers of Fibonacci numbers
This paper deals with the diophantine equation F-1(p) + 2F(2)(p )+ . . . + kF(k)(p) = F-n(q), an equation on the weighted power terms of Fibonacci sequence. For the exponents p, q is an element of {1, 2} the problem has already been solved in ad hoc ways using the properties of the summatory identit...
Saved in:
| Main Authors: | Gueth Krisztián, Florian Luca (Author), Szalay László (Author) |
|---|---|
| Format: | Article |
| Published: |
2020
|
| Series: | PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES
96 No. 4 |
| Subjects: | |
| Online Access: | http://publicatio.uni-sopron.hu/1946 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fibonacci diophantine triples
by: Luca F, et al.
Published: (2008) -
Fibonacci numbers of the form p(a) +/- p(b)+1
by: Luca F, et al.
Published: (2007) -
Linear diophantine equation with three consecutive binomial coefficients
by: Luca F, et al.
Published: (2004) -
Inequalities among related pairs of Fibonacci numbers
by: Atanassov KT, et al.
Published: (2003) -
Algorithm to solve certain ternary quartic Diophantine equations
by: Szalay László
Published: (2013)