Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Series TitleSeries Title
-
Reading LevelReading Level
-
YearFrom:-To:
-
More FiltersMore FiltersContent TypeItem TypeIs Full-Text AvailableSubjectCountry Of PublicationPublisherSourceTarget AudienceDonorLanguagePlace of PublicationContributorsLocation
Done
Filters
Reset
2,848
result(s) for
"Fibonacci numbers"
Sort by:
On b-concatenations of two k-generalized Fibonacci numbers
2025
Let k≥2 be an integer. One of the generalization of the classical Fibonacci sequence is defined by the recurrence relation Fn(k)=Fn-1(k)+⋯+Fn-k(k) for all n≥2 with the initial values Fi(k)=0 for i=2-k,…,0 and F1(k)=1.Fn(k) is an order k generalization of the Fibonacci sequence and it is called k-generalized Fibonacci sequence or shortly k-Fibonacci sequence. Banks and Luca [7], among other things, determined all Fibonacci numbers which are concatenations of two Fibonacci numbers. In this paper, we consider the analogue of this problem in more general manner by taking into account the concatenations of two terms of the same sequence in base b≥2. First, we show that there exists only finitely many such concatenations for each k≥2 and b≥2. Next, we completely determine all these concatenations for all k≥2 and 2≤b≤10.
Journal Article
Growing patterns : Fibonacci numbers in nature
by
Campbell, Sarah C., 1966-
,
Campbell, Richard P., ill
in
Fibonacci numbers Juvenile literature.
,
Mathematics in nature Juvenile literature.
,
Fibonacci numbers.
2010
What's the biggest mathematical mystery in nature? Fibonacci numbers! The pattern creeps up in the most unexpected places. It's clear that math holds secrets to nature and that nature holds secret numbers.
Error detection and correction for coding theory on k-order Gaussian Fibonacci matrices
2023
In this study, the coding theory defined for k-order Gaussian Fibonacci polynomials is rearranged by taking $ x = 1 $ . We call this coding theory the k-order Gaussian Fibonacci coding theory. This coding method is based on the $ {Q_k}, {R_k} $ and $ E_n^{(k)} $ matrices. In this respect, it differs from the classical encryption method. Unlike classical algebraic coding methods, this method theoretically allows for the correction of matrix elements that can be infinite integers. Error detection criterion is examined for the case of $ k = 2 $ and this method is generalized to $ k $ and error correction method is given. In the simplest case, for $ k = 2 $ , the correct capability of the method is essentially equal to 93.33%, exceeding all well-known correction codes. It appears that for a sufficiently large value of $ k $ , the probability of decoding error is almost zero.
Journal Article
The man of numbers : Fibonacci's arithmetic revolution
by
Devlin, Keith J. author
in
Fibonacci, Leonardo, approximately 1170-approximately 1240
,
Mathematicians Italy Biography
,
Fibonacci numbers
2011
\"The untold story of Leonardo of Pisa, the medieval mathematician who introduced Arabic numbers to the West and helped launch the modern era.\"--Page [2] of dust jacket.
Generalized Cassini identities via the generalized Fibonacci fundamental system. Applications
by
Craveiro, I. M.
,
Rachidi, M.
,
Pereira Spreafico, E. V.
in
Applications of Mathematics
,
Fibonacci numbers
,
Mathematicians
2024
In this paper we explore the generalized Cassini identities for the weighted generalized Fibonacci sequences, through the associated generalized Fibonacci fundamental system. Some algebraic, combinatoric and analytic properties of these identities are established. Applications to generalized Fibonacci and Pell numbers are provided, and some special cases are studied.
Journal Article
Rabbits, rabbits everywhere : a Fibonacci tale
by
McCallum, Ann, 1965-
,
Kendall, Gideon, ill
in
Rabbits Fiction.
,
Fibonacci numbers Fiction.
,
Sequences (Mathematics) Fiction.
2007
Rapidly multiplying rabbits are taking over the village of Chee, and soon there are so many that even the Pied Piper cannot get rid of them, but a girl named Amanda discovers a pattern that leads to a way to make the rabbits leave.
Novel Results for Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals
by
Zeyada, Nasr Anwer
,
Abd-Elhameed, Waleed Mohamed
,
Philippou, Andreas N.
in
Fibonacci numbers
,
generalized Fibonacci and generalized Lucas numbers
,
Hypergeometric functions
2022
The goal of this study is to develop some new connection formulae between two generalized classes of Fibonacci and Lucas polynomials. Hypergeometric functions of the kind 2F1(z) are included in all connection coefficients for a specific z. Several new connection formulae between some famous polynomials, such as Fibonacci, Lucas, Pell, Fermat, Pell–Lucas, and Fermat–Lucas polynomials, are deduced as special cases of the derived connection formulae. Some of the introduced formulae generalize some of those existing in the literature. As two applications of the derived connection formulae, some new formulae linking some celebrated numbers are given and also some newly closed formulae of certain definite weighted integrals are deduced. Based on using the two generalized classes of Fibonacci and Lucas polynomials, some new reduction formulae of certain odd and even radicals are developed.
Journal Article
Wild Fibonacci : nature's secret code revealed
by
Hulme, Joy N
,
Schwartz, Carol, 1954- ill
in
Fibonacci numbers Juvenile literature.
,
Recurrent sequences (Mathematics) Juvenile literature.
,
Mathematics in nature Juvenile literature.
2010
Discover the fibonacci sequence as it appears in nature, from the curves of a sundial shell, to a parrot's beak, a hawk's talon, a ram's horn, and even human teeth!
On Matrices with Bidimensional Fibonacci Numbers
2026
In this paper, the bidimensional extensions of the Fibonacci numbers are explored, along with a detailed examination of their properties, characteristics, and some identities. We introduce and study the matrices with bidimensional Fibonacci numbers, focusing in particular on their recurrence relation, key properties, determinant, and various other identities. It is our purpose to study the matrix version of bidimensional Fibonacci numbers and provide new results and sometimes extensions of some results existing in the literature. We aim to introduce these matrices using the bidimensional Fibonacci numbers and to give the determinant of these matrices.
Journal Article