Lucas generalized numbers in Narayana's cows sequence

dc.contributor.authorODJOUMANI, Japhet
dc.contributor.authorNIKIEMA, Salifou
dc.date.accessioned2026-06-02T16:06:57Z
dc.date.available2026-06-02T16:06:57Z
dc.date.issued2023
dc.description.abstractLet $\{N_n\}_{n≥0}$ be the Narayana’s cows sequence given by $N_0= 0,\;N_1=N_2=1$ and $N_{n+3}=N_{n+2}+N_n$, for integers $n≥0$ and let $\{U_n\}_{n≥0}$ be the generalized Lucas sequence with parameters integers $a≥1,\; b=±1$ given by $U_0=0,\; U_1= 1$ and $U_{n+2}=aU_{n+1}+bU_n$, for integers $n≥0$. In this paper we give effective bounds for the Diophantine equation $N_m=U_n$, in positive unknowns $m$ and $n$. We then solve explicitly that equation with Fibonacci, Pell and Balancing sequences cases.
dc.identifier.doi10.56947/gjom.v15i1.1381
dc.identifier.otherBECDB-14032
dc.identifier.urihttps://dspace.uac.bj/handle/123456789/11983
dc.language.isofr
dc.relation.ispartofGulf Journal of Mathematics
dc.subjectDiophantine equations
dc.subjectgeneralized Lucas sequence
dc.subjectNarayana’s cowssequence
dc.subjectlinear forms in logarithms
dc.subjectreduction method.
dc.titleLucas generalized numbers in Narayana's cows sequence
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
0b0ad50f8af99df48c3d0c972569c055.pdf
Size:
356.26 KB
Format:
Adobe Portable Document Format

Collections