Powers of Two in Generalized Fibonacci Sequences
The k-generalized Fibonacci sequence \big(Fn(k)\big)n resembles the Fibonacci sequence in that it starts with 0,…,0,1 (k terms) and each term afterwards is the sum of the k preceding terms. In this paper, we are interested in finding powers of two that appear in k-generalized Fibonacci sequences; i.e., we study the Diophantine equation Fn(k)=2m in positive integers n,k,m with k≥ 2.
Enregistré dans:
Auteurs principaux: | , |
---|---|
Format: | Digital revista |
Langue: | English |
Publié: |
Universidad Nacional de Colombia y Sociedad Colombiana de Matemáticas
2012
|
Accès en ligne: | http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0034-74262012000100005 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
id |
oai:scielo:S0034-74262012000100005 |
---|---|
record_format |
ojs |
spelling |
oai:scielo:S0034-742620120001000052014-04-08Powers of Two in Generalized Fibonacci SequencesBRAVO,JHON J.LUCA,FLORIAN Fibonacci numbers Lower bounds for nonzero linear forms in logarithms of algebraic numbers The k-generalized Fibonacci sequence \big(Fn(k)\big)n resembles the Fibonacci sequence in that it starts with 0,…,0,1 (k terms) and each term afterwards is the sum of the k preceding terms. In this paper, we are interested in finding powers of two that appear in k-generalized Fibonacci sequences; i.e., we study the Diophantine equation Fn(k)=2m in positive integers n,k,m with k≥ 2.info:eu-repo/semantics/openAccessUniversidad Nacional de Colombia y Sociedad Colombiana de MatemáticasRevista Colombiana de Matemáticas v.46 n.1 20122012-06-01info:eu-repo/semantics/articletext/htmlhttp://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0034-74262012000100005en |
institution |
SCIELO |
collection |
OJS |
country |
Colombia |
countrycode |
CO |
component |
Revista |
access |
En linea |
databasecode |
rev-scielo-co |
tag |
revista |
region |
America del Sur |
libraryname |
SciELO |
language |
English |
format |
Digital |
author |
BRAVO,JHON J. LUCA,FLORIAN |
spellingShingle |
BRAVO,JHON J. LUCA,FLORIAN Powers of Two in Generalized Fibonacci Sequences |
author_facet |
BRAVO,JHON J. LUCA,FLORIAN |
author_sort |
BRAVO,JHON J. |
title |
Powers of Two in Generalized Fibonacci Sequences |
title_short |
Powers of Two in Generalized Fibonacci Sequences |
title_full |
Powers of Two in Generalized Fibonacci Sequences |
title_fullStr |
Powers of Two in Generalized Fibonacci Sequences |
title_full_unstemmed |
Powers of Two in Generalized Fibonacci Sequences |
title_sort |
powers of two in generalized fibonacci sequences |
description |
The k-generalized Fibonacci sequence \big(Fn(k)\big)n resembles the Fibonacci sequence in that it starts with 0,…,0,1 (k terms) and each term afterwards is the sum of the k preceding terms. In this paper, we are interested in finding powers of two that appear in k-generalized Fibonacci sequences; i.e., we study the Diophantine equation Fn(k)=2m in positive integers n,k,m with k≥ 2. |
publisher |
Universidad Nacional de Colombia y Sociedad Colombiana de Matemáticas |
publishDate |
2012 |
url |
http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0034-74262012000100005 |
work_keys_str_mv |
AT bravojhonj powersoftwoingeneralizedfibonaccisequences AT lucaflorian powersoftwoingeneralizedfibonaccisequences |
_version_ |
1755932847934275584 |