On almost-primes in arithmetic progressions
From MaRDI portal
The author uses the methods of his previous paper [ibid. 13, 387-401 (1989; Zbl 0689.10052)] to obtain the following dual result: For a fixed integer a and \(Q<q\leq 20\), \((q,a)=1\) there exists an almost-prime \(P_ 2\) such that \(P_ 2\equiv a\) mod q, \(P_ 2\leq \tau (a)(\log q)^ 7\) for all except possibly O(Q/log Q) moduli q. Here \(\tau\) denotes the divisor function, and the O-constant is absolute.
Recommendations
Cited in
(14)- Almost-primes in arithmetic progressions and short intervals
- An analog of the generalized Hardy-Littlewood problem with almost prime numbers
- Almost primes whose expansion in base \(r\) misses some digits
- Higher Mertens constants for almost primes
- On the geometric progressions formed by \(k\) distinct pseudoprime numbers
- Balancing non-Wieferich primes in arithmetic progressions
- On almost prime \(k\)-tuples
- scientific article; zbMATH DE number 3871487 (Why is no real title available?)
- Complementary results on the search of primes from lesser primes
- Primes in arithmetic progressions and semidefinite programming
- On products of primes and almost primes in arithmetic progressions
- Almost-primes represented by p+a^m
- On the least almost-prime in arithmetic progression
- On the least almost-prime in arithmetic progressions.
This page was built for publication: On almost-primes in arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925239)
