This function is finite for all finite values of t, and allows itself to be
developed in powers of tt as a very rapidly converging series. Since, for
a value of s whose real part is greater than 1, log ⇣(s)=
P
log(1 p
s
)
remains finite, and since the same holds for the logarithms of the other factors
of ⇠(t), it follows that the function ⇠(t) can only vanish if the imaginary part
of t lies b etween
1
2
i and
1
2
i. The number of roots of ⇠(t) = 0, whose real
parts lie between 0 and T is approximately
=
T
2⇡
log
T
2⇡
T
2⇡
;
because the integral
R
d log ⇠(t), taken in a positive sense around the region
consisting of the values of t whose imaginary parts lie between
1
2
i and
1
2
i
and whose real parts lie between 0 and T , is (up to a fraction of the order
of magnitude of the quantity
1
T
) equal to
✓
T log
T
2⇡
T
◆
i; this integral
however is equal to the number of roots of ⇠(t) = 0 lying within in this
region, multiplied by 2⇡i. One now finds indeed approximately this number
of real roots within these limits, and it is very probable that all roots are
real. Certainly one would wish for a stricter proof here; I have meanwhile
temporarily put aside the search for this after some fleeting futile attempts,
as it appears unnecessary for the next objective of my investigation.
If one denotes by ↵ all the roots of the equation ⇠(↵) = 0, one can express
log ⇠(t) as
P
log
✓
1
tt
↵↵
◆
+ log ⇠(0);
for, since the density of the roots of the quantity t grows with t only as
log
t
2⇡
, it follows that this expression converges and becomes for an infinite t
only infinite as t log t; thus it di↵ers from log ⇠(t) by a function of tt, that
for a finite t remains continuous and finite and, when divided by tt, becomes
infinitely small for infinite t. This di↵erence is consequently a constant, whose
value can be determined through setting t = 0.
With the assistance of these methods, the number of prime numbers that
are smaller than x can now be determined.
Let F (x) be equal to this number when x is not exactly equal to a prime
number; but let it be greater by
1
2
when x is a prime number, so that, for
any x at which there is a jump in the value in F (x),
F (x)=
F (x + 0) + F (x 0)
2
.
If in the identity
log ⇣(s)=
P
log(1 p
s
)=
P
p
s
+
1
2
P
p
2s
+
1
3
P
p
3s
+ ···
4