Narayana numbers that are products of two Fibonacci numbers

Abstract

Let \Nm\m0 be the Narayana's cows sequence given by N0=0, N1=1=N2=1 and \[ Nm+3=Nm+2+Nm, for \; m≥ 0 \] and let \Fn\n0 be the Fibonacci sequence. In this paper we solve explicitely the Diophantine equation \[ Nm=FnFk, \] in positive unknowns m,\,n and k. That is, we find the non-zero narayana numbers that are products of two Fibonacci numbers.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…