Chebyshev's bias for composite numbers with restricted prime divisors

Details Chebyshev's bias for composite numbers with restricted prime divisors Chebyshev's bias for composite numbers with restricted prime divisors

2001-12-11

arxiv.org/abs/math/0112100v1

Math. Comp. 73 (2004), 425-449

Mathematics

Number Theory

26 pages

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Chebyshev's bias for composite numbers with restricted prime divisors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Chebyshev's bias for composite numbers with restricted prime divisors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chebyshev's bias for composite numbers with restricted prime divisors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-140180