On terms of linear recurrence sequences with only one distinct block of digits

Diego Marques; Alain Togbé

Colloquium Mathematicae (2011)

  • Volume: 124, Issue: 2, page 145-155
  • ISSN: 0010-1354

Abstract

top
In 2000, Florian Luca proved that F₁₀ = 55 and L₅ = 11 are the largest numbers with only one distinct digit in the Fibonacci and Lucas sequences, respectively. In this paper, we find terms of a linear recurrence sequence with only one block of digits in its expansion in base g ≥ 2. As an application, we generalize Luca's result by finding the Fibonacci and Lucas numbers with only one distinct block of digits of length up to 10 in its decimal expansion.

How to cite

top

Diego Marques, and Alain Togbé. "On terms of linear recurrence sequences with only one distinct block of digits." Colloquium Mathematicae 124.2 (2011): 145-155. <http://eudml.org/doc/283813>.

@article{DiegoMarques2011,
abstract = {In 2000, Florian Luca proved that F₁₀ = 55 and L₅ = 11 are the largest numbers with only one distinct digit in the Fibonacci and Lucas sequences, respectively. In this paper, we find terms of a linear recurrence sequence with only one block of digits in its expansion in base g ≥ 2. As an application, we generalize Luca's result by finding the Fibonacci and Lucas numbers with only one distinct block of digits of length up to 10 in its decimal expansion.},
author = {Diego Marques, Alain Togbé},
journal = {Colloquium Mathematicae},
keywords = {Fibonacci numbers; Lucas numbers; digits; linear forms in logarithm; reduction method; linear recurrence sequence},
language = {eng},
number = {2},
pages = {145-155},
title = {On terms of linear recurrence sequences with only one distinct block of digits},
url = {http://eudml.org/doc/283813},
volume = {124},
year = {2011},
}

TY - JOUR
AU - Diego Marques
AU - Alain Togbé
TI - On terms of linear recurrence sequences with only one distinct block of digits
JO - Colloquium Mathematicae
PY - 2011
VL - 124
IS - 2
SP - 145
EP - 155
AB - In 2000, Florian Luca proved that F₁₀ = 55 and L₅ = 11 are the largest numbers with only one distinct digit in the Fibonacci and Lucas sequences, respectively. In this paper, we find terms of a linear recurrence sequence with only one block of digits in its expansion in base g ≥ 2. As an application, we generalize Luca's result by finding the Fibonacci and Lucas numbers with only one distinct block of digits of length up to 10 in its decimal expansion.
LA - eng
KW - Fibonacci numbers; Lucas numbers; digits; linear forms in logarithm; reduction method; linear recurrence sequence
UR - http://eudml.org/doc/283813
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.