Number of prime factors over arithmetic progressions

DOI10.1093/QMATHJ/HAZ040MaRDI QIDQ5108039zbMATH OpenOpenAlexFDO

Authors Xianchang Meng

Publication date 29 April 2020

Published in The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/qmathj/haz040

zbMATH Keywords

arithmetic progressionsDirichlet character

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Primes in congruence classes (11N13)

Recommendations

• On the function: Number of prime factors of \(N\).
• On arithmetic progressions having only few different prime factors in comparison with their length
• Biases in prime factorizations and Liouville functions for arithmetic progressions
• On the number of prime factors of a finite arithmetical progression
• The number of prime factors on average in certain integer sequences

Cited in

(9)

• Duality between prime factors and an application to the prime number theorem for arithmetic progressions
• Biases in prime factorizations and Liouville functions for arithmetic progressions
• Sums of two squares are strongly biased towards quadratic residues
• Cayley numbers with arbitrarily many distinct prime factors
• scientific article; zbMATH DE number 2005658 (Why is no real title available?)
• scientific article; zbMATH DE number 1775203 (Why is no real title available?)
• scientific article; zbMATH DE number 6848573 (Why is no real title available?)
• A simple note on the number-theoretic function \(\Omega (n)\) and Dirichlet \(L\)-functions
• An annotated bibliography for comparative prime number theory

This page was built for publication: Number of prime factors over arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108039)