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

Let ${\left(G_n\right)}_{n\ge 1}$ be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are $\left\{U_n\right\}$ and $\left\{V_n\right\}$, respectively. We show that the Diophantine equation $G_n=B·(g^{lm}-1)/(g^l-1)$ has only finitely many solutions in $n,m\in {\mathbb{Z}}^{+}$, where $g\ge 2$, $l$ is even and $1\le B\le g^l-1$. Furthermore, these solutions can be effectively determined by reducing such equation to biquadratic elliptic curves. Then, by a result of Baker (and its best improvement due to Hajdu and Herendi) related to the bounds of the integral points on...

The Markoff conjecture states that given a positive integer $c$, there is at most one triple $(a,b,c)$ of positive integers with $a\le b\le c$ that satisfies the equation $a^2+b^2+c^2=3abc$. The conjecture is known to be true when $c$ is a prime power or two times a prime power. We present an elementary proof of this result. We also show that if in the class group of forms of discriminant $d=9c^2-4$, every ambiguous form in the principal genus corresponds to a divisor of $3c-2$, then the conjecture is true. As a result, we obtain criteria in terms of...

D'après le théorème de Lévy, les dénominateurs du développement en fraction continue d'un réel croissent presque sûrement à une vitesse au plus exponentielle. Nous étendons cette estimation aux meilleures approximations diophantiennes simultanées de formes linéaires.

Let ${\left(L_n\right)}_{n\ge 0}$ be the Lucas sequence. We show that the Diophantine equation $L_n-L_m=M_k$ has only the nonnegative integer solutions $(n,m,k)=(2,0,1)$, $(3,1,2)$, $(3,2,1)$, $(4,3,2)$, $(5,3,3)$, $(6,2,4)$, $(6,5,3)$ where $M_k=2^k-1$ is the $k$th Mersenne number and $n>m$.