三个斐波那契数之和作为基$b$下三个重复数字的连接
Sums of three Fibonacci numbers as concatenations of three repdigits in base $b$
AI总结:
本文研究了基$b$下三个重复数字连接的三个斐波那契数之和,证明在$2\leq b\leq 10$范围内只有有限多个解,并确定了最大解为$b=4$时的$F_{42}+F_{29}+F_{20}=268435290$。
摘要:
本文研究了可以表示为基$b$下三个重复数字连接的三个斐波那契数之和。我们证明对于基$2\leq b\leq 10$,只有有限多个这样的和存在,并且我们明确确定了所有这些解。其中最大的解出现在$b=4$时,给出$F_{42}+F_{29}+F_{20}=268435290=\overline{33333333331122}_4$。
英文摘要:
In this paper, we investigate sums of three Fibonacci numbers that can be expressed as concatenations of three repdigits in base $b$, where $b\ge 2$ is an integer. We prove that for bases $2\le b\le 10$, only finitely many such sums exist, and we determine all of them explicitly. Among these solutions, the largest occurs for $b=4$ and is given by $$ F_{42}+F_{29}+F_{20}=268435290=\overline{33333333331122}_4. $$
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。