Related papers: An explicit formula generating the non-Fibonacci n…
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
Let n_g denote the number of numerical semigroups of genus g. Bras-Amoros conjectured that n_g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree.…
Let $g \geq 2$. A real number is said to be g-normal if its base g expansion contains every finite sequence of digits with the expected limiting frequency. Let \phi denote Euler's totient function, let \sigma be the sum-of-divisors…
In this paper, we establish improved effective irrationality measures for certain numbers of the form $\sqrt[3]{n}$, using approximations obtained from hypergeometric functions. These results are very close to the best possible using this…
In 1987, R. B. Paris uses the analytic function \[\label{main} g(w)=\lim_{n\to\infty}(2\varphi)^n\biggl(\underbrace{\sqrt{1+\sqrt{1+...\sqrt{1+w}}}}_n-\varphi\biggr),\ \ \ \varphi=\frac{1+\sqrt{5}}2, \] to estimate the convergence of nested…
It is shown, subject to the abc-conjecture, that \[\sum_{n\le N}\exp(2\pi i\alpha n^3)\ll_{\epsilon,\alpha}N^{5/7+\epsilon}\] for any $\epsilon>0$ and any quadratic irrational $\alpha$.
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
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.…
In this paper, we find all Fibonacci numbers which are products of two Pell numbers and all Pell numbers which are products of two Fibonacci numbers.
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…
We prove that five ways to define entry A086377 in the On-Line Encyclopedia of Integer Sequences do lead to the same integer sequence.
A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…
In 2007, Tachiya gave necessary and sufficient conditions for the transcendence of certain infinite products involving Fibonacci numbers $F_k$ and Lucas numbers $L_k$. In the present note, we explicitly evaluate two classes of his algebraic…
We will show that the number of integers $\leq x$ that can be written as the square of an integer plus the square of a prime equals $\frac{\pi}{2} \cdot \frac {x}{\log x}$ minus a secondary term of size $x/(\log x)^{ 1+\delta+o(1)}$, where…
We develop ladders that reduce $\zeta(n):=\sum_{k>0}k^{-n}$, for $n=3,5,7,9,11$, and $\beta(n):=\sum_{k\ge0}(-1)^k(2k+1)^{-n}$, for $n=2,4,6$, to convergent polylogarithms and products of powers of $\pi$ and $\log2$. Rapid computability…
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
We study the linear fractional transformations in the Hecke group $G(\Phi)$ where $\Phi$ is either root of $x^2 - x -1$ (the larger root being the "golden ratio" $\phi = 2 \cos \frac {\pi}5$.) Let $g \in G(\Phi)$ and let $z$ be a generic…
We provide a family of expressions of $\pi$ in terms of the golden ratio $\phi$ in the same spirit of the formula obtained by Bailey, Borwein and Plouffe for $\pi$. Connection with cyclotomic polynomials is outlined.
For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…
Is there any other proportion for a rectangle, other than the Golden Proportion, that will allow the process of cutting off successive squares to produce an infinite paving of the original rectangle by squares of different sizes? The answer…