Abstract: | Let denote the number of primes with . Chebyshev's bias is the phenomenon for which ``more often' , than the other way around, where is a quadratic nonresidue mod and is a quadratic residue mod . If for every up to some large number, then one expects that for every . Here denotes the number of integers such that every prime divisor of satisfies . In this paper we develop some tools to deal with this type of problem and apply them to show that, for example, for every . 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 for a much larger class of constants. |