We prove that there are only finitely many odd perfect powers in $\mathbb{N}$ having precisely four nonzero digits in their binary expansion. The proofs in fact lead to more general results, but we have preferred to limit ourselves to the present statement for the sake of simplicity and clarity of illustration of the methods. These methods combine various ingredients: results (derived from the Subspace Theorem) on integer values of analytic series at $S$-unit points (in a suitable $\nu$-adic convergence), Roth’s...

A set of m positive integers with the property that the product of any two of them is the predecessor of a perfect square is called a Diophantine m-tuple. Much work has been done attempting to prove that there exist no Diophantine quintuples. In this paper we give stringent conditions that should be met by a putative Diophantine quintuple. Among others, we show that any Diophantine quintuple a,b,c,d,e with a < b < c < d < e$satisfies$d < 1.55·1072$and$b < 6.21·1035$when4a<b,whileforb<4aonehaseither$c = a + b + 2√(ab+1) and $d<1.96·{10}^{53}$...

In this paper we prove a lower bound for the linear dependence of three positive rational numbers under certain weak linear independence conditions on the coefficients of the linear forms. Let $\Lambda =b_{2}log{\alpha }_2-b_{1}log{\alpha }_1-b_{3}log{\alpha }_3\ne 0$ with $b_1,b_2,b_3$ positive integers and ${\alpha }_1,{\alpha }_2,{\alpha }_3$ positive multiplicatively independent rational numbers greater than $1$. Let ${\alpha }_{j1}={\alpha }_{j1}/{\alpha }_{j2}$ with ${\alpha }_{j1},{\alpha }_{j2}$ coprime positive integers $(j=1,2,3)$. Let ${\alpha }_j\ge \text{max}\{{\alpha }_{j1},e\}$ and assume that gcd$(b_1,b_2,b_3)=1.$ Let$$b^{\text{'}}=\left(\frac{b_2}{log{\alpha }_1}+\frac{b_1}{log{\alpha }_2}\right)\left(\frac{b_2}{log{\alpha }_3}+\frac{b_3}{log{\alpha }_2}\right)$$and assume that $B\ge \text{max}\{10,log{b}^{\text{'}}\}.$ We prove that either $\{b_1,b_2,b_3\}$ is $\left(c_4,B\right)$-linearly dependent over $\mathbb{Z}$ (with respect to $\left(a_1,a_2,a_3\right)$) or$$\Lambda \&gt;exp\left\{-C{B}^2\left(\prod _{j=1}^{3}log{a}_j\right)\right\},$$where $c_4$ and $C=c_1{c}_{2}log\rho +\delta$ are given in the tables...

1. Introduction. Our aim is to test numerically the new method of interpolation determinants (cf. [2], [6]) in the context of linear forms in two logarithms. In the recent years, M. Mignotte and M. Waldschmidt have used Schneider's construction in a series of papers [3]-[5] to get lower bounds for such a linear form with rational integer coefficients. They got relatively precise results with a numerical constant around a few hundreds. Here we take up Schneider's method again in the framework...

A positive $n$ is called a balancing number if $$1+2+\cdots +(n-1)=(n+1)+(n+2)+\cdots +(n+r).$$ We prove that there is no balancing number which is a term of the Lucas sequence.

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

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$.