Advanced Search

For k ≥ 2, the k-generalized Fibonacci sequence $\left(F{ₙ}^{\left(k\right)}\right)ₙ$ is defined to have the initial k terms 0,0,...,0,1 and be such that each term afterwards is the sum of the k preceding terms. We will prove that the number of solutions of the Diophantine equation $F{ₘ}^{\left(k\right)}-F{ₙ}^{\left(\ell \right)}=c>0$ (under some weak assumptions) is bounded by an effectively computable constant depending only on c.

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 evidence supporting...

In 2000, Florian Luca proved that F₁₀ = 55 and L₅ = 11 are the largest numbers with only one distinct digit in the Fibonacci and Lucas sequences, respectively. In this paper, we find terms of a linear recurrence sequence with only one block of digits in its expansion in base g ≥ 2. As an application, we generalize Luca's result by finding the Fibonacci and Lucas numbers with only one distinct block of digits of length up to 10 in its decimal expansion.

Let ${\left(a_n\right)}_{n\ge 1}$ be the sequence given by $a_1=1$ and $a_n=n^{a_{n-1}}$ for $n\ge 2$. In this paper, we show that the only solution of the equation $$a_1+\cdots +a_n=m^l$$ is in positive integers $l\>1,m$ and $n$ is $m=n=1$.

In this note, we prove that there is no transcendental entire function $f\left(z\right)\in \mathbb{Q}\left[\right[z\left]\right]$ such that $f\left(\mathbb{Q}\right)\subseteq \mathbb{Q}$ and $\mathrm{den}f(p/q)=F\left(q\right)$, for all sufficiently large $q$, where $F\left(z\right)\in \mathbb{Z}\left[z\right]$.

In this paper, we find all solutions of the Diophantine equation $x^2+2^{\alpha }{5}^{\beta }{17}^{\gamma }=y^n$ in positive integers $x,y\ge 1$, $\alpha ,\beta ,\gamma ,n\ge 3$ with $gcd(x,y)=1$.