Biases in prime factorizations and Liouville functions for arithmetic progressions

DOI10.5802/JTNB.1066zbMATH Open1472.11042arXiv1704.07979OpenAlexW2967551370WikidataQ114013350 ScholiaQ114013350MaRDI QIDQ2199486FDOQ2199486

Peter J. Humphries, Tian An Wong, Snehal M. Shekatkar

Publication date: 11 September 2020

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

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 $4k+1$ tend to appear an even number of times in the prime factorization of a given integer, more so than for primes of the form $4k+3$. We are led to consider variants of P'olya's conjecture, supported by extensive numerical evidence, and its relation to other conjectures.

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

Recommendations

• Large bias for integers with prime factors in arithmetic progressions
• Number of prime factors over arithmetic progressions
• The first moment of primes in arithmetic progressions: beyond the Siegel–Walfisz range
• Sign changes in \(\pi_{q,a}(x) - \pi_{q,b}(x)\)

zbMATH Keywords

arithmetic progressionsprime factorizationLiouville function[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=P%EF%BF%BD%EF%BF%BDlya%27s+conjecture&go=Go P��lya's conjecture]

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Langlands (L)-functions; one variable Dirichlet series and functional equations (11F66) Factorization; primality (11A51) Primes in congruence classes (11N13)

Cites Work

• Multiplicative number theory. I. Classical theory
• Multiplicative functions in short intervals
• The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions
• A disproof of a conjecture of Pólya
• Random matrix theory and the derivative of the Riemann zeta function
• On Two Conjectures in the Theory of Numbers
• LARGE BIAS FOR INTEGERS WITH PRIME FACTORS IN ARITHMETIC PROGRESSIONS
• A property of the set of prime numbers
• Sign changes in sums of the Liouville function
• Limiting distributions of the classical error terms of prime number theory
• Linear relations of zeroes of the zeta-function
• Completely multiplicative functions taking values in ${-1,1}$
• On the constant in the Mertens product for arithmetic progressions. I: Identities
• 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
• The distribution of k-free numbers and the derivative of the Riemann zeta-function
• On sums of multiplicative functions over numbers all of whose prime divisors belong to given arithmetic progressions

Cited In (1)

• Fake mu’s

This page was built for publication: Biases in prime factorizations and Liouville functions for arithmetic progressions

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