a) for , ;
b) for , ;
c) for complex modulo ,
d) for real primitive modulo ,
e) for there exists at most one , and at most one real primitive modulo for which can have a real zero , where is a simple zero; and for all such that , with a real modulo , one has ().
Page's theorem on , the number of prime numbers , () for , where and are relatively prime numbers. With the symbols and conditions of Section 1, on account of a)–c) and e) one has
where or in accordance with whether exists or not for a given ; because of , for any one has for a given ,
This result is the only one (1983) that is effective in the sense that if is given, then one can state numerical values of and the constant appearing in the symbol . Replacement of the bound in
by the Siegel bound: for , , extends the range of (*) to essentially larger , for any fixed , but the effectiveness of the bound in (*) is lost, since for a given it is impossible to estimate and .
A. Page established these theorems in .
|||A. Page, "On the number of primes in an arithmetic progression" Proc. London Math. Soc. Ser. 2 , 39 : 2 (1935) pp. 116–141|
|||A.A. Karatsuba, "Fundamentals of analytic number theory" , Moscow (1975) (In Russian)|
|||K. Prachar, "Primzahlverteilung" , Springer (1957)|
Page theorem. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Page_theorem&oldid=36163