Linear forms in -adic logarithms. II
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 with positive integers and positive multiplicatively independent rational numbers greater than . Let with coprime positive integers . Let and assume that gcd Letand assume that We prove that either is -linearly dependent over (with respect to ) orwhere and 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 is called a balancing number if 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 and .
Let be a binary linear recurrence sequence that is represented by the Lucas sequences of the first and second kind, which are and , respectively. We show that the Diophantine equation has only finitely many solutions in , where , is even and . 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...