On some arithmetical properties of Lucas and Lehmer numbers (Q3947723)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3765876
Language Label Description Also known as
default for all languages
No label defined
    English
    On some arithmetical properties of Lucas and Lehmer numbers
    scientific article; zbMATH DE number 3765876

      Statements

      On some arithmetical properties of Lucas and Lehmer numbers (English)
      0 references
      1982
      0 references
      Lucas numbers
      0 references
      Lehmer numbers
      0 references
      Thue-Mahler equation
      0 references
      restricted set of prime divisors
      0 references
      0 references
      Let \(u_n\) be a Lucas or a Lehmer number. Let \(p_1, \ldots, p_s\) be rational primes with \( \max (p_i)=P\), and let \(S\) denote the set of integers which have only these primes as prime factors. The author with \textit{P. Kiss} and \textit{A. Schinzel} (see the preceding review Zbl 0487.10010) proved that when \(n>6\) and \(u_n \in S\) then \(n \le \max \{C_1, P+1\} \) and \(\max \{|\alpha|,|\beta|, u_n\}< C_2\), where \(C_1\) is an absolute constant and \( C_2\) is an effectively computable positive number depending only on \(P\) and \(s\). The aim of this paper is to give the dependence of \(C_2\) from \(P\) and \(s\) in explicit form. Further it is proved that, if \(u_n\) is sufficiently large, then \[ 4sP^2 \log P>\log \log |u_n| \text{ and } P> 1/2 (\log \log |u_n|)^{1/3}, \] where \(s\) is the number of prime divisors and \(P\) is the greatest prime divisor of \(u_n\).
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references