Complex Fibonacci $p$-Numbers
DOI:
https://doi.org/10.26713/cma.v4i3.195Keywords:
Complex Fibonacci $p$-numbers, Complex Fibonacci numbers, Fibonacci $p$-numbersAbstract
In the present paper, the complex Fibonacci $p$-numbers are defined by two-dimensional recurrence relation and some results are obtained.
Downloads
References
C.J. Harman, Complex Fibonacci numbers, The Fibonacci Quarterly 19 (1981), 82-86.
A.F. Horadam, Complex Fibonacci numbers and Fibonacci quaternions, Amer. Math. Monthly 70 (1963), 289-291.
S. Pethe and A.F. Horadam, Generalized Gaussian Fibonacci numbers, Bull. Austral. Math. Soc. 33 (1986), 37-48.
G. Berzsenyi, Gaussian Fibonacci numbers, The Fibonacci Quarterly 15 (1977), 233-236.
A. Stakhov and B. Rozin, Theory of Binet formulas for Fibonacci and Lucas $p$-numbers, Chaos Solitons and Fractals 27 (2006), 1162-1177.
D. Tasci and M.C. Firengiz, Incomplete Fibonacci and Lucas $p$-numbers, Mathematical and Computer Modelling 52 (2010), 1763-1770.
N. Tuglu, G. Kocer and A. Stakhov, Bivariate Fibonacci like $p$-polynomials, Applied Mathematics and Computation 217 (2011), 10239-10246.
Downloads
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.