Papers
Topics
Authors
Recent
Search
2000 character limit reached

Narayana numbers that are products of two Fibonacci numbers

Published 23 Jul 2025 in math.NT | (2508.02688v1)

Abstract: Let Nm<em>m≥0{N_m}<em>{m\ge0} be the Narayana's cows sequence given by N0=0N_0=0, N1=1=N2=1N_1=1=N_2=1 and [ N{m+3}=N_{m+2}+N_m,\quad \text{ for }\; m\geq 0 ] and let Fnn≥0{F_n}_{n\ge0} be the Fibonacci sequence. In this paper we solve explicitely the Diophantine equation [ N_m=F_nF_k, ] in positive unknowns m, nm,\,n and kk. That is, we find the non-zero narayana numbers that are products of two Fibonacci numbers.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.