DIOPHANTINE REPRESENTATION OF LEONARDO NUMBERS AND AN EXPONENTIAL DIOPHANTINE EQUATION
Overview & Synopsis
In this paper, we show that the positive Leonardo numbers are precisely the positive values of an explicitly constructed polynomial of degree nine in two variables, thereby providing an explicit Diophantine representation of the sequence. We also determine all nonnegative integer solutions of the exponential Diophantine equation L n = 2 a + 3 b + 5 c , under the condition max{a, b} โค c. The proof combines Matveev's theorem on linear forms in logarithms with the Baker-Davenport reduction method to derive effective upper bounds, which are subsequently refined by a finite computation. As a consequence, we prove that the equation admits exactly four nonnegative integer solutions, namely (n, a, b, c) โ {(2, 0, 0, 0), (3, 0, 1, 0), (4, 0, 1, 1), (5, 0, 2, 1)}.
hal.science)
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | DIOPHANTINE REPRESENTATION OF LEONARDO NUMBERS AND AN EXPONENTIAL DIOPHANTINE EQUATION |
|---|---|
| Author / Organization | G Padmavathy, Muthukrishnan Subramani |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2026 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-201223 |
| Original Source Link | Visit Source Page on hal.science » |