Denote by S the set of non-zero integers composed only of finitely many given primes. We proved with Kiss and Schinzel  that if un is a Lucas or Lehmer number with n>6 and un∈S, then |un| can be estimated from above in terms of S. An explicit upper bound for |un| was given later in our article . In the present paper a significant improvement of this bound is established which implies, among other things, that P(un)>14 (log log |un|)1/2 if n>30or if 30≥n>6 and |un| is sufficiently large.
|Number of pages||7|
|Journal||Annales Mathematicae et Informaticae|
|Publication status||Published - Jan 1 2003|
ASJC Scopus subject areas
- Computer Science(all)