Chebyshev’s bias for composite numbers with restricted prime divisors

DOI10.1090/S0025-5718-03-01536-9zbMATH Open1045.11063arXivmath/0112100MaRDI QIDQ4433141FDOQ4433141

Authors: Pieter Moree 

Publication date: 29 October 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon that `more often' P(x;d,n)>P(x;d,r) than the other way around, where n is a quadratic non-residue mod d and r is a quadratic residue mod d. If P(x;d,n)>=P(x;d,r) for every x up to some large number, then one expects that N(x;d,n)>=N(x;d,r) for every x. Here N(x;d,a) denotes the number of integers n<=x such that every prime divisor p of n satisfies p=a(mod d). In this paper we develop some tools to deal with this type of problem and apply them to show that, for example, N(x;4,3)>=N(x;4,1) for every x. In the process we express the so called second order Landau-Ramanujan constant as an infinite series and show that the same type of formula holds true for a much larger class of constants. In a sequel to this paper the methods developed here will be used and somewhat refined to resolve a conjecture from P. Schmutz Schaller to the extent that the hexagonal lattice is `better' than the square lattice (see p. 201 of Bull. Amer. Math. Soc. 35 (1998), 193-214).

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

Recommendations

• Chebyshev's Bias
• Zeros of Dirichlet \(L\)-functions near the real axis and Chebyshev's bias
• Unconditional Chebyshev biases in number fields
• Chebyshev's Bias for Products of Two Primes
• Prime Number Races

zbMATH Keywords

Chebyshev's biascomparative number theoryprimes in progressionLandau-Ramanujan constant

Mathematics Subject Classification ID

Distribution of primes (11N05) Distribution of integers with specified multiplicative constraints (11N25) Evaluation of number-theoretic constants (11Y60)

Cites Work

• Divisibilite de certaines fonctions arithmétiques
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Chebyshev's Bias
• Primes in arithmetic progressions
• Advanced Topics in Computional Number Theory
• Approximate formulas for some functions of prime numbers
• Das asymptotische Verhalten von Summen über multiplikative Funktionen
• Approximation of singular series and automata
• Title not available (Why is that?)
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Ramanujan's unpublished manuscript on the partition and tau functions with proofs and commentary
• The arithmetic-geometric mean of Gauss
• Generalized Euler constants for arithmetical progressions
• Sums of nonnegative multiplicative functions over integers without large prime factors. I
• Landau-Siegel zeroes and black hole entropy.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Geometry of Riemann surfaces based on closed geodesics
• On a claim of Ramanujan in his first letter to Hardy
• The Second-Order Term in the Asymptotic Expansion of B(x)
• Further developments in the comparative prime-number theory I
• APPLICATION OF SOME INTEGRAL EQUATIONS TO PROBLEMS OF NUMBER THEORY
• Mertens' theorem for arithmetic progressions
• Details of the First Region of Integers x with π 3,2 (x) < π 3,1 (x)
• The Error Term for the Squarefree Integers
• On some claims in Ramanujan's `unpublished' manuscript on the partition and tau functions
• Distribution functions and positive definite functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The hexagonal versus the square lattice
• Title not available (Why is that?)
• Sign changes in \(\pi_{q,a}(x) - \pi_{q,b}(x)\)
• Title not available (Why is that?)

Cited In (13)

• The hexagonal versus the square lattice
• Values of the Euler \(\varphi\)-function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields
• Solutions of the congruence \(1+2^{f(n)}+\ldots +n^{f(n)}\equiv 0 \pmod n\)
• On the average number of elements in a finite field with order or index in a prescribed residue class
• Large bias for integers with prime factors in arithmetic progressions
• Explicit sieve estimates and nonexistence of odd multiperfect numbers of a certain form
• Zeros of Dirichlet \(L\)-functions near the real axis and Chebyshev's bias
• Asymptotic distribution of Beurling integers
• Densities of integer sets represented by quadratic forms
• Chebyshev's bias for products of irreducible polynomials
• Sums of two squares are strongly biased towards quadratic residues
• Well-rounded sublattices of planar lattices
• Chebyshev's Bias

This page was built for publication: Chebyshev’s bias for composite numbers with restricted prime divisors

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