Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fibonacci and Lucas numbers as products of three repdigits in base $g$

Published 29 Dec 2022 in math.NT | (2212.14247v1)

Abstract: Recall that repdigit in base $g$ is a positive integer that has only one digit in its base $g$ expansion, i.e. a number of the form $a(gm-1)/(g-1)$, for some positive integers $m\geq 1$, $g\geq 2$ and $1\leq a\leq g-1$. In the present study we investigate all Fibonacci or Lucas numbers which are expressed as products of three repdigits in base $g$. As illustration, we consider the case $g=10$ where we show that the numbers 144 and 18 are the largest Fibonacci and Lucas numbers which can be expressible as products of three repdigits respectively. All this can be done using linear forms in logarithms of algebraic numbers.

Citations (9)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.