Related papers: Fibonacci Expansions
A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…
In this paper, we consider the new q-extension of Frobenius-Euler numbers and polynomials and we derive some interesting identities from the orthogonality type properties for the new q-extension of Frobenius-Euler polynomials. Finally we…
The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…
We modify the rules of the classical Tower of Hanoi puzzle in a quite natural way to get the Fibonacci sequence involved in the optimal algorithm of resolution, and show some nice properties of such a variant. In particular, we deduce from…
We generalize classical results on the gap distribution (and other fine-scale statistics) for the one-dimensional Farey sequence to arbitrary dimension. This is achieved by exploiting the equidistribution of horospheres in the space of…
The article uses an arithmetic-geometric Fibonacci series to find the expected value of trials needed to observe k consecutive successes for the first time in a Bernoulli experiment using a recurrence relation. It is important to note that…
Srinivasa Ramanujan provided series expansions of certain arithmetical functions in terms of the exponential sums defined by $c_r(n) = \sum\limits_{\substack{{m=1}\\ (m,r)=1}}^{r} e^{\frac{2 \pi imn}{r}}$ in [Trans. Cambridge Phillos. Soc,…
For real numbers a, b> 1, let as a_b denote the result of interpreting a in base b instead of base 10. We define ``dungeons'' (as opposed to ``towers'') to be numbers of the form a_b_c_d_..._e, parenthesized either from the bottom upwards…
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…
We develop in detail most of the theory of the Picard scheme that Grothendieck sketched in two Bourbaki talks and in commentaries on them. Also, we review in brief much of the rest of the theory developed by Grothendieck and by others. But…
It is a well known result that for $\beta\in(1,\frac{1+\sqrt{5}}{2})$ and $x\in(0,\frac{1}{\beta-1})$ there exists uncountably many $(\epsilon_{i})_{i=1}^{\infty}\in {0,1}^{\mathbb{N}}$ such that…
The analogue of Goldie's Theorem for prime rings is proved for rings graded by abelian groups, eliminating unnecessary additional hypotheses used in earlier versions.
This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…
Rook theory has been investigated by many people since its introduction by Kaplansky and Riordan in 1946. Goldman, Joichi and White in 1975 showed that the sum over $k$ of the product of the $(n-k)$-th rook numbers multiplied by the $k$-th…
In this paper, we introduce fiboquadratic sequences as an extension to infinity of the board of Rithmomachia and we prove that this extension gives raise to fiboquadratic sequences which we define here. Also, fiboquadratic sequences provide…
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…
Since their introduction in the early sixties, the R\'enyi entropies have been used in many contexts, ranging from information theory to astrophysics, turbulence phenomena and others. In this note, we enlighten the main connections between…
The study of Diophantine triples taking values in linear recurrence sequences is a variant of a problem going back to Diophantus of Alexandria which has been studied quite a lot in the past. The main questions are, as usual, about existence…
In this paper we study a generalization of the Fibonacci sequence in which rabbits are mortal and take more that two months to become mature. In particular we give a general recurrence relation for these sequences (improving the work in the…