Large bias for integers with prime factors in arithmetic progressions
From MaRDI portal
Publication:4604499
Abstract: We prove an asymptotic formula for the number of integers which can be written as the product of distinct primes with each prime factor in an arithmetic progression , . For any , our result is uniform for . Moreover, we show that, there are large biases toward certain arithmetic progressions , and such biases have connections with Mertens' theorem and the least prime in arithmetic progressions.
Recommendations
- Big biases amongst products of two primes
- Chebyshev's bias for products of \(k\) primes
- Mertens' theorem for arithmetic progressions
- Biases in prime factorizations and Liouville functions for arithmetic progressions
- The first moment of primes in arithmetic progressions: beyond the Siegel–Walfisz range
Cites work
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 108037 (Why is no real title available?)
- scientific article; zbMATH DE number 473229 (Why is no real title available?)
- scientific article; zbMATH DE number 1542664 (Why is no real title available?)
- A lower bound for biases amongst products of two primes
- A problem of Chowla revisited
- Big biases amongst products of two primes
- Chebyshev's Bias for Products of Two Primes
- Chebyshev’s bias for composite numbers with restricted prime divisors
- Computing the Mertens and Meissel-Mertens constants for sums over arithmetic progressions
- Functions of several complex variables and their singularities. Transl. from the German by Philip G. Spain
- Multiplicative number theory. I. Classical theory
- On a problem of Chowla
- On the distribution of amicable numbers.
- On the number of restricted prime factors of an integer. I
- On the order of Dirichlet \(L\)-functions
- Transcendental numbers
Cited in
(4)
This page was built for publication: Large bias for integers with prime factors in arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604499)