Answers are grounded in this paper and cite their sources.
Let (Fₙ)n≥ 0 be a Fibonacci sequence. A non-negative integer whose digits are all equal is called a repdigit and any non-zero repdigit is of the form a ( 10ᵈ-1/9 ) where 1 ≤ a ≤ 9 and 1 ≤ d . In this paper, we search all repdigits that can be written as products of three Fibonacci numbers. As a mathematical expression, we find all non-negative integer solutions $(n,m,l,a,d)$ of the Diophantine equation FₙFₘFₗ =a ( 10ᵈ-1/9 ), 1 ≤ l ≤ m ≤ n and 1 ≤ a ≤ 9.
No takes yet. Share an insight, caveat, or question.
Alan et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: