We consider the Tribonacci sequence $T:={T_n}_{n\ge 0}$ given by T₀ = 0, T₁ = T₂ = 1 and $T_{n+3}=T_{n+2}+T_{n+1}+T_n$ for all n ≥ 0, and we find all triples of Tribonacci numbers which are multiplicatively dependent.

Depuis un peu plus de vingt ans, la recherche de minorations de combinaisons linéaires de logarithmes de nombres algébriques avec des coefficients algébriques a fait l'objet de nombreux travaux. Dès que le nombre de logarithmes dépasse 2, toutes les démonstrations utilisées jusqu'à présent reposaient sur la méthode de Baker. Nous proposons ici d'autres méthodes.

A criterion is given for studying (explicit) Baker type lower bounds of linear forms in numbers $1,{\Theta }_1,...,{\Theta }_m\in ℂ*$ over the ring $\mathbb{Z}$ of an imaginary quadratic field . This work deals with the simultaneous auxiliary functions case.

Let $k\ge 2$ and let ${\left(P_n^{\left(k\right)}\right)}_{n\ge 2-k}$ be the $k$-generalized Pell sequence defined by $$P_n^{\left(k\right)}=2P_{n-1}^{\left(k\right)}+P_{n-2}^{\left(k\right)}+\cdots +P_{n-k}^{\left(k\right)}$$ for $n\ge 2$ with initial conditions $$P_{-(k-2)}^{\left(k\right)}=P_{-(k-3)}^{\left(k\right)}=\cdots =P_{-1}^{\left(k\right)}=P_0^{\left(k\right)}=0,P_1^{\left(k\right)}=1.$$ In this study, we handle the equation $P_n^{\left(k\right)}=y^m$ in positive integers $n$, $m$, $y$, $k$ such that $k,y\ge 2,$ and give an upper bound on $n.$ Also, we will show that the equation $P_n^{\left(k\right)}=y^m$ with $2\le y\le 1000$ has only one solution given by $P_7^{\left(2\right)}={13}^2.$

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.

P. 294, line 14: For “Satz 8” read “Satz 7”, and for “equation (10)” read “equation (13)”.

1. Introduction. Let ℤ, ℕ, ℚ be the sets of integers, positive integers and rational numbers respectively. In [7], Ribenboim proved that the equation    (1) $(x^m+1)(x^n+1)=y²$, x,y,m,n ∈ ℕ, x > 1, n > m ≥ 1, has no solution (x,y,m,n) with 2|x and (1) has only finitely many solutions (x,y,m,n) with 2∤x. Moreover, all solutions of (1) with 2∤x satisfy max(x,m,n) < C, where C is an effectively computable constant. In this paper we completely determine all solutions of (1) as follows.   Theorem. Equation (1)...

For an integer k ≥ 2, let $\left(F{ₙ}^{\left(k\right)}\right)ₙ$ be the k-Fibonacci sequence which starts with 0,..., 0,1 (k terms) and each term afterwards is the sum of the k preceding terms. This paper completes a previous work of Marques (2014) which investigated the spacing between terms of distinct k-Fibonacci sequences.