EconPapers    
Economics at your fingertips  
 

Effective Bounds for Narayana Numbers that Admit Zeckendorf Partition in k Terms: Explicit Results for k∈3,4

Salifou Nikiema, Awaou Laré Ousseni, Japhet Odjoumani and Guy Degla

International Journal of Mathematics and Mathematical Sciences, 2026, vol. 2026, 1-9

Abstract: The mathematician Zeckendorf proved that every positive integer has a unique decomposition into a sum of distinct and nonconsecutive Fibonacci numbers, known as the Zeckendorf partition. Let Nmm≥0 be the Narayana’s cows sequence given by N0=N1=N2=1 and Nm+3=Nm+2+Nm, for m≥0. A term of this sequence is called a Narayana number. In this paper, we applied the linear forms in logarithms to the Zeckendorf decomposition of the Narayana cow’s sequence Nmm≥0. We give effective computable bounds for the decomposition. As applications, we explicitly determine all the Narayana numbers that admit a Zeckendorf partition into exactly three terms or exactly four terms.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ijmms/2026/2018690.pdf (application/pdf)
http://downloads.hindawi.com/journals/ijmms/2026/2018690.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:2018690

DOI: 10.1155/ijmm/2018690

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().

 
Page updated 2026-11-16
Handle: RePEc:hin:jijmms:2018690