The paper presents, among others, the golden number $\varphi$ as the limit of the quotient of neighboring terms of the Fibonacci and Fibonacci type sequence by means of a fixed point of a mapping of a certain interval with the help of Edelstein’s theorem. To demonstrate the equality  , where $f_n$ is $n$-th Fibonacci number also the formula from Corollary has been applied. It was obtained using some relationships between Fibonacci and Lucas numbers, which were previously justified.

The Pell sequence ${\left(P_n\right)}_{n=0}^{\infty }$ is the second order linear recurrence defined by $P_n=2P_{n-1}+P_{n-2}$ with initial conditions $P_0=0$ and $P_1=1$. In this paper, we investigate a generalization of the Pell sequence called the $k$-generalized Pell sequence which is generated by a recurrence relation of a higher order. We present recurrence relations, the generalized Binet formula and different arithmetic properties for the above family of sequences. Some interesting identities involving the Fibonacci and generalized Pell numbers...

A generalization of the well-known Fibonacci sequence ${Fₙ}_{n\ge 0}$ given by F₀ = 0, F₁ = 1 and $F_{n+2}=F_{n+1}+Fₙ$ for all n ≥ 0 is the k-generalized Fibonacci sequence ${F{ₙ}^{\left(k\right)}}_{n\ge -(k-2)}$ whose first k terms are 0,..., 0, 1 and each term afterwards is the sum of the preceding k terms. For the Fibonacci sequence the formula $Fₙ²+F{²}_{n+1}²=F_{2n+1}$ holds for all n ≥ 0. In this paper, we show that there is no integer x ≥ 2 such that the sum of the xth powers of two consecutive k-generalized Fibonacci numbers is again a k-generalized Fibonacci number. This...

Melham discovered the Fibonacci identity $F_{n+1}{F}_{n+2}{F}_{n+6}-F{³}_{n+3}=(-1)ⁿFₙ$. He then considered the generalized sequence Wₙ where W₀ = a, W₁ = b, and $Wₙ=p{W}_{n-1}+q{W}_{n-2}$ and a, b, p and q are integers and q ≠ 0. Letting e = pab - qa² - b², he proved the following identity: $W_{n+1}{W}_{n+2}{W}_{n+6}-W{³}_{n+3}=e{q}^{n+1}(p³W_{n+2}-q²W_{n+1})$. There are similar differences of products of Fibonacci numbers, like this one discovered by Fairgrieve and Gould: $FₙF_{n+4}{F}_{n+5}-F{³}_{n+3}={(-1)}^{n+1}{F}_{n+6}$. We prove similar identities. For example, a generalization of Fairgrieve and Gould’s identity is $WₙW_{n+4}{W}_{n+5}-W{³}_{n+3}=eqⁿ(p³W_{n+4}-q{W}_{n+5})$.

Using the lower bound of linear forms in logarithms of Matveev and the theory of continued fractions by means of a variation of a result of Dujella and Pethő, we find all $k$-Fibonacci and $k$-Lucas numbers which are Fermat numbers. Some more general results are given.

We show that the only Lucas numbers which are factoriangular are $1$ and $2$.

We give a new and elementary proof of Jackson’s terminating $q$-analogue of Dixon’s identity by using recurrences and induction.

In this paper, we find all Pell and Pell-Lucas numbers written in the form $-2^a-3^b+5^c$, in nonnegative integers $a$, $b$, $c$, with $0\le max\{a,b\}\le c$.

Let P and Q be nonzero integers. The sequences of generalized Fibonacci and Lucas numbers are defined by U₀ = 0, U₁ = 1 and $U_{n+1}=PUₙ-Q{U}_{n-1}$ for n ≥ 1, and V₀ = 2, V₁ = P and $V_{n+1}=PVₙ-Q{V}_{n-1}$ for n ≥ 1, respectively. In this paper, we assume that P ≥ 1, Q is odd, (P,Q) = 1, Vₘ ≠ 1, and $V_r\ne 1$. We show that there is no integer x such that $Vₙ=V_{r}Vₘx²$ when m ≥ 1 and r is an even integer. Also we completely solve the equation $Vₙ=VₘV_{r}x²$ for m ≥ 1 and r ≥ 1 when Q ≡ 7 (mod 8) and x is an even integer. Then we show that when P ≡ 3 (mod 4) and...

Let $k\ge 2$ and define $F^{\left(k\right)}:={\left(F_n^{\left(k\right)}\right)}_{n\ge 0}$, the $k$-generalized Fibonacci sequence whose terms satisfy the recurrence relation $F_n^{\left(k\right)}=F_{n-1}^{\left(k\right)}+F_{n-2}^{\left(k\right)}+\cdots +F_{n-k}^{\left(k\right)}$, with initial conditions $0,0,\cdots ,0,1$ ($k$ terms) and such that the first nonzero term is $F_1^{\left(k\right)}=1$. The sequences $F:=F^{\left(2\right)}$ and $T:=F^{\left(3\right)}$ are the known Fibonacci and Tribonacci sequences, respectively. In 2005, Noe and Post made a conjecture related to the possible solutions of the Diophantine equation $F_n^{\left(k\right)}=F_m^{\left(\ell \right)}$. In this note, we use transcendental tools to provide a general method for finding the intersections $F^{\left(k\right)}\cap F^{\left(m\right)}$ which gives...

For an integer $k\ge 2$, let ${\left(n\right)}_n$ be the $k-$generalized Pell sequence which starts with $0,...,0,1$ ($k$ terms) and each term afterwards is given by the linear recurrence $n=2n-1+n-2+\cdots +n-k$. In this paper, we find all $k$-generalized Pell numbers with only one distinct digit (the so-called repdigits). Some interesting estimations involving generalized Pell numbers, that we believe are of independent interest, are also deduced. This paper continues a previous work that searched for repdigits in the usual Pell sequence ${\left(P_n^{\left(2\right)}\right)}_n$. ...

We compare the growth of the least common multiple of the numbers $u_{a_1},...,u_{a_n}$ and $|u_{a_1}\cdots u_{a_n}|$, where ${\left(u_n\right)}_{n\ge 0}$ is a Lucas sequence and ${\left(a_n\right)}_{n\ge 0}$ is some sequence of positive integers.

Let $F_n$ be the $n$-th Fibonacci number. Put $\varphi =\frac{1+\sqrt{5}}{2}$. We prove that the following inequalities hold for any real $\alpha$: 1) ${inf}_{n\in \mathbb{N}}\left|\right|F_n\alpha \left|\right|\le \frac{\varphi -1}{\varphi +2}$, 2) ${lim\; inf}_{n\to \infty }\left|\right|F_n\alpha \left|\right|\le \frac{1}{5}$, 3) ${lim\; inf}_{n\to \infty }\left|\right|{\varphi }^n\alpha \left|\right|\le \frac{1}{5}$. These results are the best possible.

Let $\left\{U_n\right\}=\left\{U_n(P,Q)\right\}$ and $\left\{V_n\right\}=\left\{V_n(P,Q)\right\}$ be the Lucas sequences of the first and second kind respectively at the parameters $P\ge 1$ and $Q\in \{-1,1\}$. In this paper, we provide a technique for characterizing the solutions of the so-called Bartz-Marlewski equation $$x^2-3xy+y^2+x=0,$$ where $(x,y)=(U_i,U_j)$ or $(V_i,V_j)$ with $i$, $j\ge 1$. Then, the procedure of this technique is applied to completely resolve this equation with certain values of such parameters.

Consider a recurrence sequence ${\left(x_k\right)}_{k\in \mathbb{Z}}$ of integers satisfying $x_{k+n}=a_{n-1}{x}_{k+n-1}+...+a₁x_{k+1}+a₀x_k$, where $a₀,a₁,...,a_{n-1}\in \mathbb{Z}$ are fixed and a₀ ∈ -1,1. Assume that $x_k>0$ for all sufficiently large k. If there exists k₀∈ ℤ such that $x_{k₀}<0$ then for each negative integer -D there exist infinitely many rational primes q such that $q|x_k$ for some k ∈ ℕ and (-D/q) = -1.