Repdigits as products of two Fibonacci or Lucas numbers (Q2309759)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Repdigits as products of two Fibonacci or Lucas numbers
scientific article

    Statements

    Repdigits as products of two Fibonacci or Lucas numbers (English)
    0 references
    0 references
    0 references
    1 April 2020
    0 references
    Let \( (F_n)_{n\ge 0} \) and \( (L_n)_{n\ge 0} \) be the sequences of Fibonacci and Lucas numbers given by \( F_0=0, ~ F_1=1, ~ L_0=2, ~L_1=1 \), \( F_{n+2}=F_{n+1}+F_n \), and \( L_{n+2}=L_{n+1}+L_n \) for all \( n\ge 0 \), respectively. A repdigit is a positive integer \( N \) that has only one distinct digit when written in its decimal expansion. That is, \( N \) is of the form \begin{align*} N=\underbrace{d\cdots d}_{k \text{ times}}=d\left(\dfrac{10^{k}-1}{9}\right), \end{align*} for some positive integers \( d \) and \( k \) with \( 1\le d\le 9 \) and \( k\ge 1 \). In the paper under review, the authors study the Diophantine equations \begin{align*} F_mF_n=d\left(\dfrac{10^{k}-1}{9}\right) \quad \text{and} \quad L_mL_n=d\left(\dfrac{10^{k}-1}{9}\right), \end{align*} where \(m, n, d ,\) and \( k \) are non-negative integers with \( 1\le d\le 9 \). They prove the following results. Theorem 1. Let \( 2\le m\le n \). A product of the form \( F_mF_n \) represents a repdigit if and only if \( (m,n) \) belongs to the set \begin{align*} \left\{ (2,2), (2, 3), (3,3), (2, 4), (3, 4), (4,4), (2,5), (2,6), (2, 10)\right\}. \end{align*} Theorem 2. Let \( 0\le m\le n \). A product of the form \( L_mL_n \) represents a repdigit if and only if \( (m,n) \) belongs to the set \begin{align*} \left\{ (0,0), (0,1), (1,1), (0,2), (1,2), (2,2), (0, 3),(1, 3), (0,5), (1, 4), (1,5), (2,5), (3,5), (4, 5)\right\}. \end{align*} To prove Theorem 1 and Theorem 2, the authors use the elementary properties of the Fibonacci and Lucas sequences, the Baker's theory for linear forms in logarithms of algebraic numbers, and the Baker-Davenport reduction procedure. Computations are done with help of a computer program in Mathematica.
    0 references
    Fibonacci number
    0 references
    Lucas number
    0 references
    repdigit
    0 references
    Diophantine equations
    0 references
    linear forms in logarithms
    0 references

    Identifiers