Biases in prime factorizations and Liouville functions for arithmetic progressions
arXiv:1704.07979 · doi:10.5802/jtnb.1066
Abstract
We introduce a refinement of the classical Liouville function to primes in arithmetic progressions. Using this, we discover new biases in the appearances of primes in a given arithmetic progression in the prime factorizations of integers. For example, we observe that the primes of the form tend to appear an even number of times in the prime factorization of a given integer, more so than for primes of the form . We are led to consider variants of Pólya's conjecture, supported by extensive numerical evidence, and its relation to other conjectures.
arXiv comment25 pages, 6 figures
References in corpus (8)
- Unexpected biases in the distribution of consecutive primes
- The Distribution of Weighted Sums of the Liouville Function and Pólya's Conjecture
- On the constant in the Mertens product for arithmetic progressions. II. Numerical values
- On the constant in the Mertens product for arithmetic progressions. I. Identities
- Large bias for integers with prime factors in arithmetic progressions
- A note on Pólya's observation concerning Liouville's function
- Bounding sums of the Möbius function over arithmetic progressions
- The distribution of -free numbers and the derivative of the Riemann zeta-function