Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a result of Davenport in a way suggested by the recent work of Rubinstein and Sarnak to prove a theorem which makes it possible to compute the entire distribution of 4,3(x) - 4,1(x) including the sign change (axis crossing) regions, in time linear in x, using zeroes of L(s, ), the nonprincipal character modulo 4, generously provided to us by Robert Rumely. The accuracy with which the zeroes duplicate the distribution (Figure 1) is very satisfying. The program discovers all known axis crossing regions and finds probable regions up to 101000. Our result is applicable to a wide variety of problems in comparative prime number theory. For example, our theorem makes it possible in a few minutes of computer time to compute and plot a characteristic sample of the difference li(x) - (x) with fine resolution out to and beyon...
Carter Bays, Richard H. Hudson