Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Series Title
      Series Title
      Clear All
      Series Title
  • Reading Level
      Reading Level
      Clear All
      Reading Level
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
      More Filters
      Clear All
      More Filters
      Content Type
    • Item Type
    • Is Full-Text Available
    • Subject
    • Country Of Publication
    • Publisher
    • Source
    • Target Audience
    • Donor
    • Language
    • Place of Publication
    • Contributors
    • Location
2,848 result(s) for "Fibonacci numbers"
Sort by:
On b-concatenations of two k-generalized Fibonacci numbers
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.
Growing patterns : Fibonacci numbers in nature
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
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.
The man of numbers : Fibonacci's arithmetic revolution
\"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
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.
Rabbits, rabbits everywhere : a Fibonacci tale
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
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.
Wild Fibonacci : nature's secret code revealed
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
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.