zbMATH — the first resource for mathematics

On the greatest prime factor of \(2^p-1\) for a prime \(p\) and other expressions. (English) Zbl 0296.10021
It is proved that for almost all primes \(p\), the greatest prime factor of \((2^p-1)\) exceeds \(cp \left({\log p \over \log \log p}\right)^2\) where \(c>0\) is an absolute constant. The proof depends on Brun’s sieve method and Baker’s theory on linear forms in the logarithms of algebraic numbers. Some results relating to the greatest prime factor of other arithmetic expressions are also proved.
Reviewer: Paul Erdős

11A51 Factorization; primality
11N36 Applications of sieve methods
11J86 Linear forms in logarithms; Baker’s method
Full Text: DOI EuDML