Products of three Fibonacci numbers that are repdigits (Q6549909)

The authors prove that the largest instance of a product of three Fibonacci numbers being a repdigit is \(55\) (this is a product of three Fibonacci numbers, with two of such factors being \(1\)). The proof uses an approach via Baker's method to get an astronomical bound on the length (number of digits) of the repdigit in question (in this case \(3\cdot 10^{44}\)) and then Baker-Davenport reduction to reduce this bound to a small enough range in which one can find all solutions by enumeration.