Home Polynomials whose coefficients are generalized Leonardo numbers
Article
Licensed
Unlicensed Requires Authentication

Polynomials whose coefficients are generalized Leonardo numbers

  • Mark Shattuck
Published/Copyright: May 24, 2024
Become an author with De Gruyter Brill

Abstract

Let an be defined recursively by an = an–1 + an–2 + pn + q if n ≥ 2, with a0 = a1 = 1, where p and q are constants. The p = 0 case of an corresponds to what have been termed the generalized Leonardo numbers, the q = 1 case of which are the classical Leonardo numbers. Let Ln(x)=i=0naixni, which we refer to as a generalized Leonardo coefficient polynomial. Here, it is shown, under some mild assumptions on p and q, that Ln(x) has exactly one real zero if n is odd and no real zeros if n is even. This yields a previous result for the Fibonacci coefficient polynomials when p = q = 0 and a new analogous result for the Leonardo coefficient polynomials when p = 0, q = 1. Further, when p = 0 and –1 < q ≤ 1 + ρ, we show that the sequence consisting of the real zeros of the Ln(x) for n odd is strictly decreasing with limit –ρ, where ρ=1+52. Finally, under the same assumptions on p and q, we are able to show the convergence in modulus of all the zeros of Ln(x).

MSC 2010: Primary 11C08; 13B25
  1. Communicated by István Gaál

References

[1] Benjamin, A. T.—Quinn, J. J.: Proofs that Really Count: The Art of Combinatorial Proof, Mathematical Association of America, Washington, DC, 2003.10.5948/9781614442080Search in Google Scholar

[2] Bicknell-Johnson, M.: Divisibility properties of the Fibonacci numbers minus one, generalized toCn = Cn–1 + Cn–2 + k, Fibonacci Quart. 28(2) (1990), 107–112.10.1080/00150517.1990.12429498Search in Google Scholar

[3] Bicknell-Johnson, M.—Bergum, G. E.: The generalized Fibonacci numbersCn, Cn = Cn–1 + Cn–2 + k. In: Applications of Fibonacci Numbers (A. N. Philippou et al., eds.), D. Reidel, Dordrecht, Holland, 1988, pp. 193–205.10.1007/978-94-015-7801-1_18Search in Google Scholar

[4] Dijkstra, E. W.: Fibonacci numbers and Leonardo numbers, EWD-797, University of Texas at Austin, 1981; available online at https://www.cs.utexas.edu/users/EWD/transcriptions/EWD07xx/EWD797.html.Search in Google Scholar

[5] Dijkstra, E. W.: Smoothsort: an alternative to sorting in situ, Sci. Comput. Program. 1(3) (1982), 223–233.10.1016/0167-6423(82)90016-8Search in Google Scholar

[6] Garth, D.—Mills, D.—Mitchell, P.: Polynomials generated by the Fibonacci sequence, J. Integer Seq. 10 (2007), Art. 07.6.8.Search in Google Scholar

[7] Kuhapatanakul, K.—Chobsorn, J.: On the generalized Leonardo numbers, Integers 22 (2022), #A48.Search in Google Scholar

[8] Kürüz, F.—Dağdeviren, A.—Catarino, P.: On Leonardo Pisano hybrinomials, Mathematics 9 (2021), Art. No. 2923.10.3390/math9222923Search in Google Scholar

[9] Mansour, T.—Shattuck, M.: Polynomials whose coefficients are k-Fibonacci numbers, Ann. Math. Inform. 40 (2012), 57–76.Search in Google Scholar

[10] Mansour, T.—Shattuck, M.: Polynomials whose coefficients are generalized tribonacci numbers, Appl. Math. Comput. 219 (2013), 8366–8374.10.1016/j.amc.2012.12.052Search in Google Scholar

[11] Marden, M.: Geometry of Polynomials, 2nd edition, Mathematical Surveys, Vol. 3, American Mathematical Society, Providence, RI, 1966.Search in Google Scholar

[12] Mátyás, F.: On the generalization of the Fibonacci-coefficient polynomials, Ann. Math. Inform. 34 (2007), 71–75.Search in Google Scholar

[13] Mátyás, F.: Further generalizations of the Fibonacci-coefficient polynomials, Ann. Math. Inform. 35 (2008), 123–128.Search in Google Scholar

[14] Mátyás, F.—Liptai, K.—Tóth, J. T.—Filip, F.: Polynomials with special coefficients, Ann. Math. Inform. 37 (2010), 101–106.Search in Google Scholar

[15] Mátyás, F.—Szalay, L.: A note on Tribonacci-coefficient polynomials, Ann. Math. Inform. 38 (2011), 95–98.Search in Google Scholar

[16] Shannon, A. G.: A note on generalized Leonardo numbers, Notes Number Theory Discrete Math. 25(3) (2019), 97–101.10.7546/nntdm.2019.25.3.97-101Search in Google Scholar

[17] Shannon, A. G.—Deveci, Ö.: A note on generalized and extended Leonardo sequences, Notes Number Theory Discrete Math. 28(1) (2022), 109–114.10.7546/nntdm.2022.28.1.109-114Search in Google Scholar

[18] Shattuck, M.: Combinatorial proofs of identities for the generalized Leonardo numbers, Notes Number Theory Discrete Math. 28(4) (2022), 778–790.10.7546/nntdm.2022.28.4.778-790Search in Google Scholar

[19] Sloane, N. J.: The On-Line Encyclopedia of Integer Sequences, available at https://oeis.org, 2020.Search in Google Scholar

[20] Soykan, Y.: Generalized Leonardo numbers, J. Progressive Res. Math. 18(4) (2021), 58–84.10.20944/preprints202110.0101.v1Search in Google Scholar

Received: 2023-05-18
Accepted: 2023-08-10
Published Online: 2024-05-24
Published in Print: 2024-04-25

© 2024 Mathematical Institute Slovak Academy of Sciences

Downloaded on 24.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/ms-2024-0023/html?lang=en
Scroll to top button