Effective Bounds for Narayana Numbers that Admit Zeckendorf Partition in k Terms: Explicit Results for k ∈ {3, 4}
Open Access
- 1 January 2026
- journal article
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2026 (1) , 2018690
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 be the Narayana’s cows sequence given by N 0 = N 1 = N 2 = 1 and N m +3 = N m +2 + N m , 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 . 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.Keywords
This publication has 3 references indexed in Scilit:
- Narayana Numbers With Zeckendorf Partition in Two TermsInternational Journal of Mathematics and Mathematical Sciences, 2025
- Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powersAnnals of Mathematics, 2006
- A Generalization of a Theorem of Baker and DavenportThe Quarterly Journal of Mathematics, 1998