Phi-Bonacci Butterfly Stroke Numbers to Assess Self-Similarity in Elite Swimmers

A harmonically self-similar temporal partition, which turns out to be subtly exhibited by elite swimmers at middle distance pace, is formally defined for one of the most technically advanced swimming strokes—the butterfly. This partition relies on the generalized Fibonacci sequence and the golden ratio. Quantitative indices, named ϕ-bonacci butterfly stroke numbers, are proposed to assess such an aforementioned hidden time-harmonic and self-similar structure. An experimental validation on seven international-level swimmers and two national-level swimmers was included. The results of this paper accordingly extend the previous findings in the literature regarding human walking and running at a comfortable speed and front crawl swimming strokes at a middle/long distance pace.

On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers

The balancing number $n$ and the balancer $r$ are solution of the Diophantine equation $$1+2+\cdots+(n-1) = (n+1)+(n+2)+\cdots+(n+r). $$ It is well known that if $n$ is balancing number, then $8n^2 + 1$ is a perfect square and its positive square root is called a Lucas-balancing number. For an integer $k\geq 2$, let $(F_n^{(k)})_n$ be the $k$-generalized Fibonacci sequence which starts with $0,\ldots,0,1,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. The purpose of this paper is to show that 1, 6930 are the only balancing numbers and 1, 3 are the only Lucas-balancing numbers which are a term of $k$-generalized Fibonacci sequence. This generalizes the result from [Fibonacci Quart. 2004, 42 (4), 330-340].

Some Properties of Generalized Fibonacci Numbers: Identities, Recurrence Properties and Closed Forms of the Sum Formulas ∑nk=0 xkWmk+j

In this paper, closed forms of the summation formulas ∑nk=0 xkWmk+j for generalized Fibonacci numbers are presented. As special cases, we give summation formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers. We present the proofs to indicate how these formulas, in general, were discovered. Of course, all the listed formulas may be proved by induction, but that method of proof gives no clue about their discovery. Moreover, we give some identities and recurrence properties of generalized Fibonacci sequence.

On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3

For an integer [Formula: see text], let [Formula: see text] be the [Formula: see text]-generalized Fibonacci sequence which starts with [Formula: see text] (a total of [Formula: see text] terms) and for which each term afterwards is the sum of the [Formula: see text] preceding terms. In this paper, we find all integers [Formula: see text] with at least two representations as a difference between a [Formula: see text]-generalized Fibonacci number and a power of [Formula: see text]. This paper continues the previous work of the first author for the Fibonacci numbers, and for the Tribonacci numbers.

On Fibonacci Numbers and its Applications

In this article, we explore the representation of the product of k consecutive Fibonacci numbers as the sum of kth power of Fibonacci numbers. We also present a formula for finding the coefficients of the Fibonacci numbers appearing in this representation. Finally, we extend the idea to the case of generalized Fibonacci sequence and also, we produce another formula for finding the coefficients of Fibonacci numbers appearing in the representation of three consecutive Fibonacci numbers as a particular case. Also, we point out some amazing applications of Fibonacci numbers.

On Terms of Generalized Fibonacci Sequences which are Powers of their Indexes

The k-generalized Fibonacci sequence ( F n ( k ) ) n (sometimes also called k-bonacci or k-step Fibonacci sequence), with k ≥ 2 , is defined by the values 0 , 0 , … , 0 , 1 of starting k its terms and such way that each term afterwards is the sum of the k preceding terms. This paper is devoted to the proof of the fact that the Diophantine equation F m ( k ) = m t , with t > 1 and m > k + 1 , has only solutions F 12 ( 2 ) = 12 2 and F 9 ( 3 ) = 9 2 .

PASS-THROUGH RATE STUDY FOR HONG KONG BANKING INDUSTRY AND ITS APPLICATION TO NONMATURITY DEPOSITS INTEREST RATE RISK MANAGEMENT

Basel Committee on Banking Supervision published Standards on Interest Rate Risk in Banking Book in April 2016. Apart from others, it proposed a standardized framework under which banks should identify core and noncore deposits within their stable nonmaturity deposits (NMD) and determine appropriate cash flow slotting for the NMD. This paper proposed a unique solution to slot Core NMD into repricing time buckets to address Basel requirements on NMD. The proposed solution was based on pass-through rate model under ECM (error correction model) framework. The solution itself showed interesting mathematical property to form a generalized Fibonacci sequence with converged partial sum. What is more, this paper proposed a model-neutral back testing scheme to make objective comparison of performance across different NMD repricing behavior models. The contents of this paper are expected to be useful for practitioners due to lack of quantitative modeling and model validation methodologies on this topic in the industry while, at the same time, to motivate academic discussion on the best practice and further enhancement of the modeling approach for the industry.