Related papers: An explicit formula generating the non-Fibonacci n…
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…
In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport…
Let $\Phi(x,y)$ denote the number of integers $n\in[1,x]$ free of prime factors $\le y$. We show that but for a few small cases, $\Phi(x,y)<.6x/\log y$ when $y\le\sqrt{x}$.
The Fibonacci sequence is a series of positive integers in which, starting from $0$ and $1$, every number is the sum of two previous numbers, and the limiting ratio of any two consecutive numbers of this sequence is called the golden ratio.…
For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…
Based on the structure of Fibonacci sequence, we give a new proof for the irrationality exponents of the Fibonacci real numbers. Moreover, we obtain all the irrationality exponents of the real numbers corresponding to the differences of…
It is conjectured that there is a converging sequence of some generalized Fibonacci ratios, given the difference between consecutive ratios, such as the Golden Ratio, $\varphi^1$, and the next golden ratio $\varphi^2$. Moreover, the graphic…
Natural numbers divisible by the same prime factor lie on defined spiral graphs which are running through the Square Root Spiral (also named as the Spiral of Theodorus or Wurzel Spirale or Einstein Spiral). Prime Numbers also clearly…
We consider the asymptotics of sums of the form $$ \frac1{F_n^\sigma} \sum_{m = 1}^{F_n-1} \frac{f(m/F_n)}{\left|{\sin(\pi m/F_n)}\right|^\sigma} \frac{f(F_{n-1}m/F_n)}{\left|{\sin(\pi F_{n-1}m/F_n)}\right|^\sigma} $$ where $(F_n)_{n \in…
Let $\overline{p}(n)$ denote the overpartition function. In this paper, we obtain an inequality for the sequence $\Delta^{2}\log \ \sqrt[n-1]{\overline{p}(n-1)/(n-1)^{\alpha}}$ which states that \begin{equation*} \log…
This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.
For $\alpha>1$, set $\beta=1/(\alpha-1)$. We show that, for every $1<\alpha<(\sqrt{21}+4)/5\approx1.717$, the number of pairs $(m,n)$ of positive integers with $d=\lfloor{n^\alpha}\rfloor - \lfloor{m^\alpha}\rfloor$ is equal to…
In this paper, we present a new approach to the convolved Fibonacci numbers arising from the generating function of them and give some new and explicit identities for the convolved Fibonacci numbers.
We give multiple proofs of two formulas concerning the enumeration of permutations avoiding a monotone consecutive pattern with a certain value for the inverse peak number or inverse left peak number statistic. The enumeration in both cases…
Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive…
In analogy to a concept of Fibonacci trees, we define the leaf-Fibonacci tree of size $n$ and investigate its number of nonisomorphic leaf-induced subtrees. Denote by $f_0$ the one vertex tree and $f_1$ the tree that consists of a root with…
We study exponential sums of the form $\sum_{n=1}^N e^{2\pi i a b^n/m}$ for non-zero integers $a,b,m$. Classically, non-trivial bounds were known for $N\ge \sqrt{m}$ by Korobov, and this range has been extended significantly by Bourgain as…
By using an asymptotic formula known for the numbers of Euler and Bernoulli it is possible to obtain an explicit expression of the nth digit of $\pi$ in decimal or in binary, it also makes it possible to obtain the $n^{\rm th}$ digit of…
We show that for the classical Fibonacci sequence (Fn) and the Lucas sequence (Ln) the following identity holds for every integer n >= 2: (n-1)Fn equals the sum from k=1 to n-1 of Lk multiplied by F(n-k). Equivalently, this gives a…
For an integer $n\geq 1$, consider the $n$-th metallic number $\phi_n=\frac{n+\sqrt{n^2+4}}{2}$ (e.g. $\phi_1$ is the golden number) and denote by $[\phi_n]_q$ its $q$-deformation in the sense of S. Morier-Genoud and V. Ovsienko. This is an…