Fibonacci Polynomials and It’s Generalization
Article Sidebar
Page Numbers:
112-117
Digital Object Identifier:
10.58578/mjms.v3i1.4810
Viewed: 370 times
Downloaded: 295 times
LYAS Publisher cordially invites qualified professionals to serve as Editors or Reviewers. Your expertise will make an important contribution to maintaining and strengthening the academic quality of our publications. Interested applicants are kindly requested to complete the application form at the following link: Editors & Reviewers
Please feel free to contact us if you need any further information about the submission process or if you have any additional questions.
Authors:Nand Kishor Kumar1, Suresh Kumar Sahani2
Copyright :Authors retain copyright and grant the journal right of first publication.
Main Article Content
Abstract
This article explores the definition, properties, and generalizations of Fibonacci polynomials, providing a comprehensive understanding of their mathematical significance. We have used their Binet’s formula and generating function to derive the identities.
Citation Metrics:
Downloads
Citation Metrics & Similar Scopus Articles
-
Migliaccio A. (2027)On the average number of representations of an integer as a sum of polynomials computed at prime valuesJournal of Number Theory, 292, 186-200
-
Xiang R. (2027)Developing high-hardness cemented carbides by data-driven integration of composition and processing designJournal of Materials Science and Technology, 283, 103-113
-
Ben Taher R. (2027)The quaternionic moment problemJournal of Algebra, 713, 1-27
Article Details
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
References
Vorobyov, NN. (1963). The Fibonacci Numbers. Boston Pergamon: D.C. Health Company.
Waddill, ME, Lovis S. (1967). Another generalized fibonacci sequence. The Fibonacci Quarterly. ;5(3):209-222
Jaiswal, DV. (1969). On a generalized fibonacci sequence, Labdev. Journal of Science and Technology,7(2):67-71
Harne S, Parihar CL. (1984) Generalized fibonacci sequence. Ganit Sandesh (India),8(2):75-80.
Bortner, C. W.& Peterson, A. C. (2016). The History and Applications of Fibonacci Numbers. UCARE Research Products. 2016, 42. (http://digitalcommons.unl.edu/ucareresearch/42)
Dasdan. A. (2018). Twelve Simple Algorithms to Compute Fibonacci Numbers, Arxiv, ,1-33.
Kumar, N. K., et.al. (2024). Mu ̈ntz’s Theorem in 2-inner product spaces and it’s Applications in Economics. Journal of Multi-disciplinary Sciences, Mikailalsys, 2(3), 543-552.
Kumar, N.K. (2022). Relationship between Differential Equations and Difference Equation. Nepal University Teacher's Association Journal, 8(1-2), 88-93. DOI:10.3126/nutaj. V 8i1-2.44122
Kumar, N. K., & Sahani, S. K. (2024). Matrices of Fibonacci Numbers. Mikailalsys Journal of Mathematics and Statistics, 3(1), 71-80. https://doi.org/10.58578/mjms.v3i1.4398
Mauldin, R.D. et al. (1986). Random recursive construction. Trans Am Math Soc.
Singh. P. & Hemachandra. A. (1986). Fibonacci Numbers, Math. Ed. Siwan, 20(1), ,28–30.
Stakhov, A.P. (1989). The golden section in the measurement theory. Comput Math Appl.
Stakhov.A.P. (2005). Generalized principle of the golden section and its applications in mathematics, science and engineering. Chaos, Solitons & Fractals.