Related papers: Fibonacci numbers and Ford circles
Using Eulerian and Euler numbers, we establish congruences concerning sums involving harmonic numbers, tangent numbers and Genocchi numbers.
We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…
This contribution presents all possible solutions to the Diophantine equations $F_k=L_mL_n$ and $L_k=F_mF_n$. To be clear, Fibonacci numbers that are the product of two arbitrary Lucas numbers and Lucas numbers that are the product of two…
In this paper, we consider a conjecture of Erdos and Rosenfeld and a conjecture of Ruzsa when the number is an almost square. By the same method, we consider lattice points of a circle close to the x-axis with special radii.
We study fractions associated to Ford circles which are extracted by means continuous curves. We show that the extracted fractions have similar properties to Farey sequences, like the Farey sum, and we prove that every ordered sequence that…
In the present work we show how different ways to solve biquadratic equations can lead us to different representations of its solutions. A particular equation which has the golden ratio and its reciprocal as solutions is shown as an…
The purpose of this paper is twofold. First, the definition of new statistical convergence with Fibonacci sequence is given and some fundamental properties of statistical convergence are examined. Second, approximation theory worked as a…
In this paper, by using bi-periodic Fibonacci numbers, we introduce the bi-periodic Fibonacci octonions. After that, we derive the generating function of these octonions as well as investigated some properties over them. Also, as another…
We study the p-rationality of real quadratic fields in terms of generalized Fibonacci numbers and their periods modulo positive integers.
As a generalization of planar Fibonacci spirals that are based on the recurrence relation $F_n=F_{n-1}+F_{n-2}$, we draw assembled spirals stemming from analytic solutions of the recurrence relation $G_n=a\, G_{n-1}+b\, G_{n-2}+c\, d\,^n$,…
A chain is an ordering of the integers 1 to n such that adjacent pairs have sums of a particular form, such as squares, cubes, triangular numbers, pentagonal numbers, or Fibonacci numbers. For example 4 1 2 3 5 form a Fibonacci chain while…
This article investigates the Talbot effects in Fibonacci geometry by introducing the cut-and-project construction, which allows for capturing the entire infinite Fibonacci structure into a single computational cell. Theoretical and…
In 2013, Conway and Ryba wrote a fascinating paper called Fibonometry. The paper, as one might guess, is about the connection between Fibonacci numbers and trigonometry. We were fascinated by this paper and looked at how we could generalize…
We have extended some known results of the approximate golden spirals to generalized m-spirals built with whirling squares for any $m$ ratio ($m>1$). In particular, we have proved that circumscribed circles around squares intercept the…
We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…