scientific article; zbMATH DE number 3020664
The main result of this paper is that if \(f(n)\) is the number of representations of \(n\) as \((p-1) (q-1) (r-1)\) where \(p,q,r\) are different primes, then \(\varlimsup_{n\to \infty} f(n) = \infty\). The proof is based on a slightly more precise form of the proposition (established by the author in a previous paper, Zbl 0012.14905) that for almost all primes \(p\leq n\), \(p-1\) has between \((1-\varepsilon) \log\log n\) and \((1+\varepsilon) \log\log n\) different prime factors. He is then able to prove that, if \(p'q'r'\) denote primes with \(p'q'r' \leq n\) for which \(p'-1\), \(q'-1\), \(r'-1\) have each more than \((1-\varepsilon) \log \log n\) different prime factors, then the number of different number of the form \((p'-1) (q'-1) (r'-1)\) is of lower order of magnitude than the number of sets \(p'q'r'\). This establishes the main result. Correction. The formula between (2) and (3) should read: \[ N(P_k,n) < {C_n\over \log^2 n} {(C+\log\log n)^{k+3}\over (k-1)!} + o\left({n\over \log^2 n}\right) \] .
- scientific article; zbMATH DE number 3023193
- Product of three primes in large arithmetic progressions
- On a product of certain primes
- Products of three pairwise coprime integers in short intervals
- scientific article; zbMATH DE number 4045823
- On sums of three integers with a fixed number of prime factors
- On the residues of products of prime numbers
- Generating a product of three primes with an unknown factorization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5761111)