Large bias for integers with prime factors in arithmetic progressions

DOI10.1112/S0025579317000584zbMATH Open1428.11162arXiv1607.01882MaRDI QIDQ4604499FDOQ4604499

Authors: Xianchang Meng 

Publication date: 26 February 2018

Published in: Mathematika (Search for Journal in Brave)

Abstract: We prove an asymptotic formula for the number of integers $leqx$ which can be written as the product of $k(geq2)$ distinct primes $p_{1}cdots{p}_k$ with each prime factor in an arithmetic progression $$, $(a_j,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.

Full work available at URL: https://arxiv.org/abs/1607.01882

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

Mathematics Subject Classification ID

(zeta (s)) and (L(s, chi)) (11M06) Distribution of integers with specified multiplicative constraints (11N25) Primes in congruence classes (11N13) Distribution of integers in special residue classes (11N69)

Cites Work

• Multiplicative number theory. I. Classical theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a problem of Chowla
• Computing the Mertens and Meissel-Mertens constants for sums over arithmetic progressions
• Transcendental numbers
• A problem of Chowla revisited
• Title not available (Why is that?)
• Big biases amongst products of two primes
• Title not available (Why is that?)
• Functions of several complex variables and their singularities. Transl. from the German by Philip G. Spain
• On the distribution of amicable numbers.
• Chebyshev’s bias for composite numbers with restricted prime divisors
• On the number of restricted prime factors of an integer. I
• On the order of Dirichlet \(L\)-functions
• Chebyshev's Bias for Products of Two Primes
• A lower bound for biases amongst products of two primes

Cited In (4)

• On Erdős and Sárközy's sequences with Property P
• Large bias amongst products of two primes
• Chebyshev's bias for products of irreducible polynomials
• Biases in prime factorizations and Liouville functions for 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)