2000 character limit reached
On Diophantine equations with Fibonacci and Lucas sequences associated to Hardy-Ramanujan problem
Published 13 Dec 2023 in math.NT | (2312.07986v3)
Abstract: In this paper, we deal with Diophantine equations $N = {F_k}3 + {F_\ell }3 = {F_m}3 + {F_n}3$ and $M = {L_k}3 + {L_\ell }3 = {L_m}3 + {L_n}3$. In other words, we discover the Fibonacci and Lucas numbers that are also Hardy-Ramanujan numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.