| تعداد نشریات | 33 |
| تعداد شمارهها | 888 |
| تعداد مقالات | 8,745 |
| تعداد مشاهده مقاله | 55,357,347 |
| تعداد دریافت فایل اصل مقاله | 10,556,382 |
Application of linear forms in logarithms to the Zeckendorf decomposition of the Tribonacci-Lucas sequence: The Cases $k=3$ and $k=4$ | ||
| Journal of Algebra and Related Topics | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 27 آبان 1405 اصل مقاله (242.25 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22124/jart.2026.33292.1929 | ||
| نویسندگان | ||
| A. L. Ousseni* ؛ J. Odjoumani؛ G. Degla | ||
| Institute of Mathematics and Physics, Department of Mathematics, University of Abomey-Calavi, Dangbo, Benin | ||
| چکیده | ||
| It has been proved by the mathematician Zeckendorf that every positive integer has a unique decomposition into a sum of distinct and nonconsecutive Fibonacci numbers $\{F_n\}_{n\ge0}$, known as the Zeckendorf partition. In this paper, we applied the linear forms in logarithms to the Zeckendorf decomposition of the Tribonacci-Lucas Sequence $\{S_m\}_{m\ge0}$. We give effective computable bounds for the decomposition. As applications, we explicitly determine all the Tribonacci-Lucas numbers that admit a Zeckendorf partition into exactly three terms or exactly four terms. We found that in the case of three terms, there are exactly two, namely $S_7$ and $S_8$, and in the case of four terms, there are also two namely $S_{10}$ and $S_{13}$. | ||
| کلیدواژهها | ||
| Diophantine equations؛ Fibonacci sequence؛ Tribonacci-Lucas sequence؛ Zeckendorf partition؛ linear forms in logarithms؛ reduction method | ||
|
آمار تعداد مشاهده مقاله: 4 تعداد دریافت فایل اصل مقاله: 2 |
||