IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v27y2006i5p1162-1177.html
   My bibliography  Save this article

Theory of Binet formulas for Fibonacci and Lucas p-numbers

Author

Listed:
  • Stakhov, Alexey
  • Rozin, Boris

Abstract

Modern natural science requires the development of new mathematical apparatus. The generalized Fibonacci numbers or Fibonacci p-numbers (p=0,1,2,3,…), which appear in the “diagonal sums” of Pascal’s triangle and are assigned in the recurrent form, are a new mathematical discovery. The purpose of the present article is to derive analytical formulas for the Fibonacci p-numbers. We show that these formulas are similar to the Binet formulas for the classical Fibonacci numbers. Moreover, in this article, there is derived one more class of the recurrent sequences, which is defined to be a generalization of the Lucas numbers (Lucas p-numbers).

Suggested Citation

  • Stakhov, Alexey & Rozin, Boris, 2006. "Theory of Binet formulas for Fibonacci and Lucas p-numbers," Chaos, Solitons & Fractals, Elsevier, vol. 27(5), pages 1162-1177.
    • Handle: RePEc:eee:chsofr:v:27:y:2006:i:5:p:1162-1177
    DOI: 10.1016/j.chaos.2005.04.106
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077905004637
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2005.04.106?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kocer, E. Gokcen & Tuglu, Naim & Stakhov, Alexey, 2009. "On the m-extension of the Fibonacci and Lucas p-numbers," Chaos, Solitons & Fractals, Elsevier, vol. 40(4), pages 1890-1906.
    2. Falcón, Sergio & Plaza, Ángel, 2009. "On k-Fibonacci sequences and polynomials and their derivatives," Chaos, Solitons & Fractals, Elsevier, vol. 39(3), pages 1005-1019.
    3. E. Gokcen Kocer & Huriye Alsan, 2022. "Generalized Hybrid Fibonacci and Lucas p-numbers," Indian Journal of Pure and Applied Mathematics, Springer, vol. 53(4), pages 948-955, December.
    4. Deveci, Ömür & Hulku, Sakine & Shannon, Anthony G., 2021. "On the co-complex-type k-Fibonacci numbers," Chaos, Solitons & Fractals, Elsevier, vol. 153(P2).
    5. Fiorenza, Alberto & Vincenzi, Giovanni, 2011. "Limit of ratio of consecutive terms for general order-k linear homogeneous recurrences with constant coefficients," Chaos, Solitons & Fractals, Elsevier, vol. 44(1), pages 145-152.
    6. Kılıç, Emrah, 2009. "The generalized Pell (p,i)-numbers and their Binet formulas, combinatorial representations, sums," Chaos, Solitons & Fractals, Elsevier, vol. 40(4), pages 2047-2063.
    7. Esmaeili, Morteza & Esmaeili, Mostafa, 2009. "Polynomial Fibonacci–Hessenberg matrices," Chaos, Solitons & Fractals, Elsevier, vol. 41(5), pages 2820-2827.
    8. Stakhov, A.P., 2007. "The “golden” matrices and a new kind of cryptography," Chaos, Solitons & Fractals, Elsevier, vol. 32(3), pages 1138-1146.
    9. Nalli, Ayse & Haukkanen, Pentti, 2009. "On generalized Fibonacci and Lucas polynomials," Chaos, Solitons & Fractals, Elsevier, vol. 42(5), pages 3179-3186.
    10. Kilic, E. & Stakhov, A.P., 2009. "On the Fibonacci and Lucas p-numbers, their sums, families of bipartite graphs and permanents of certain matrices," Chaos, Solitons & Fractals, Elsevier, vol. 40(5), pages 2210-2221.
    11. Falcón, Sergio & Plaza, Ángel, 2007. "The k-Fibonacci sequence and the Pascal 2-triangle," Chaos, Solitons & Fractals, Elsevier, vol. 33(1), pages 38-49.
    12. Anatriello, Giuseppina & Németh, László & Vincenzi, Giovanni, 2022. "Generalized Pascal’s triangles and associated k-Padovan-like sequences," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 192(C), pages 278-290.
    13. Flavio Pressacco & Giacomo Plazzotta & Laura Ziani, 2014. "K-Fibonacci sequences and minimal winning quota in Parsimonious game," Working Papers hal-00950090, HAL.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:27:y:2006:i:5:p:1162-1177. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.