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 leqx which can be written as the product of k(geq2) distinct primes p1cdotspk with each prime factor in an arithmetic progression , (aj,q)=1 (qgeq3,1leqjleqk). For any A>0, our result is uniform for 2leqkleqAloglogx. 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.









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)