|
|
|
cq (mod n) s.t. a large number q divides p - 1 without remainder (p-1|q) and c, n; (c, n)=1 (meaning coprime: with only unity as common factor). Then m
n. Thus, for 2, 3, 5, 7, p(n) = 4. G. H. Hardy (`877-1947) & E. M. Wright estimate (using floor function PL): p(n) = - 1 Sj=3n[(j - 2)! - j |_ (j - 2)!/j _|]. The asymptotic value, PL:p(n) ~ li(x), where li(x) is the logarithmic integral, PL. Also, PL asymptotic prime numbertheorem.
x).
O.
O, then, in its sequence, M' = p1, p2
, ..., pk, q1, ..., we find the new prime pk+1 = q1. In other words, application (to N) of each sieving step yields the next prime.
( ), involving coprimality, that is, sharing a common prime
factor.
(p) = p(1 - 1/p) = p - 1.
x). Useful in writing sieving(PL) asa clusion (PL) in terms of prime factors, pi, i = 1,..., r: p(N) - p(