On the spacing between terms of generalized Fibonacci sequences
Colloquium Mathematicum, Tome 134 (2014) no. 2, pp. 267-280
Cet article a éte moissonné depuis la source Institute of Mathematics Polish Academy of Sciences
For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined to have the initial $k$ terms $0,0,\ldots ,0,1$ and be such that each term afterwards is the sum of the $k$ preceding terms. We will prove that the number of solutions of the Diophantine equation $F_m^{(k)}-F_n^{(\ell )}=c>0$ (under some weak assumptions) is bounded by an effectively computable constant depending only on $c$.
Keywords:
geq k generalized fibonacci sequence defined have initial terms ldots each term afterwards sum preceding terms prove number solutions diophantine equation f ell under weak assumptions bounded effectively computable constant depending only nbsp
Affiliations des auteurs :
Diego Marques  1
@article{10_4064_cm134_2_10,
author = {Diego Marques},
title = {On the spacing between terms of generalized {Fibonacci} sequences},
journal = {Colloquium Mathematicum},
pages = {267--280},
year = {2014},
volume = {134},
number = {2},
doi = {10.4064/cm134-2-10},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/cm134-2-10/}
}
Diego Marques. On the spacing between terms of generalized Fibonacci sequences. Colloquium Mathematicum, Tome 134 (2014) no. 2, pp. 267-280. doi: 10.4064/cm134-2-10
Cité par Sources :