Numerically Explicit Estimates for the Distribution of Rough Numbers
Kai (Steve) Fan
Department of Mathematics, Dartmouth College, Hanover, NH 03755, USA
[email protected]
Abstract.
For and , let denote the number of positive integers up to free of prime divisors less than or equal to . In 1950 de Bruijn [Br] studied the approximation of by the quantity
where is Euler’s constant and
He showed that the asymptotic formula
holds uniformly for all , where is a positive decreasing function related to
the error estimates in the Prime Number Theorem. In this paper we obtain numerically explicit versions of de Bruijn’s result.
Key words and phrases:
Rough numbers, Buchstab’s function, the Prime Number Theorem
2020 Mathematics Subject Classification:
11N25
1. Introduction
Let be positive real numbers. Throughout the paper, we shall always write , and the letters and will always denote primes. We say that a positive integer is -rough if all the prime divisors of are greater than . Let denote the number of -rough numbers up to . Explicitly, we have
where denotes the least prime divisor of , with the convention that . When , or equivalently when , we simply have , where is the prime-counting function. The function is closely related to the sieve of Eratosthenes, one of the most ancient algorithms for finding primes, and it has been extensively studied by mathematicians. A simple application of the inclusion-exclusion principle enables us to write
(1.1)
where is the integer part of for any , is the Möbius function, and denotes the product of primes up to . If is relatively small in comparison with , say , the above formula can be used to obtain as , where is Euler’s constant. However, it turns out that this nice asymptotic formula does not hold uniformly, as already exemplified by the base case .
In 1937, Buchstab [Bu] showed that for any fixed , one has as , where is defined to be the unique continuous solution to the delay differential equation for , subject to the initial value condition for . Comparing this result with the asymptotic formula obtained from (1.1), one would expect that as . Indeed, it can be shown [T, Corollary III.6.5] that for . Moreover, it is known that oscillates above and below infinitely often. It is convenient to extend the definition of by setting for all , so that satisfies the same delay differential equation on . In the sequel, we shall write and for the right derivatives of at and , respectively. With this convention, we have for all .
Buchstab’s asymptotic formula can be proved easily based on the following identity [T, Theorem III.6.3] named after him:
(1.2)
for any . The Buchstab function then appears naturally in the iteration process, starting with in the range . Since for , Buchstab’s asymptotic formula suggests that the relation holds uniformly for . Thus, it is of interest to seek numerically explicit estimates for that are applicable in wide ranges. Confirming a conjecture of Ford, the author [F] showed that holds uniformly for , which is essentially best possible when , where is fixed. On the other hand, the values of indicate that improvements should be expected in the narrower range . In recent work jointly with Pomerance [FP], the author proved that holds uniformly for . This inequality provides a fairly good upper bound for , especially considering that the absolute maximum of over is given by , attained at the unique critical point of the function on . With a bit more effort, one can show, using the Buchstab identity (1.2), that
(1.3)
uniformly for (see [T, Theorem III.6.4]). In Section 2, we shall derive a numerically explicit lower bound of this type that suits our needs. Our method can also be modified with ease to obtain a numerically explicit upper bound of the same type.
In [Br] de Bruijn provided a more precise approximation for than . Let us fix some for the moment. Suppose that there exist a positive constant and a positive decreasing function defined on , such that , that as and that for all we have
(1.4)
and
(1.5)
where is the logarithmic integral defined by
The classical version of the Prime Number Theorem allows us to take for some suitable constant . Using the zero-free region of Korobov and Vinogradov for the Riemann zeta-function, we obtain for some absolute constant . If the Riemann Hypothesis holds, then one can take , where is an absolute constant.
To state de Bruijn’s result, we define
It is easy to see that and that for every fixed , we have as . Precise expansions for in terms of the powers of can be found in [T, Theorem III.6.18]. When , the change of variable shows that
Essentially, de Bruijn [Br] showed that this formula holds uniformly for . In Section 3 we shall derive an explicit version of (1.6), which will be applied in Section 4 to obtain numerically explicit estimates with suitable and . Our main results are summarized in the following theorem.
Theorem 1.1.
Uniformly for , we have
Conditionally on the Riemann Hypothesis, we have
uniformly for .
The following consequence of Theorem 1.1 is sometimes more convenient to use.
Corollary 1.2.
Uniformly for , we have
Conditionally on the Riemann Hypothesis, we have
uniformly for .
2. Lower Bounds for
Before moving on to the derivation of Theorem 1.1, we prove a clean lower bound for which is applicable in a wide range. This lower bound, which is interesting in itself, will be used in the proof of Theorem 1.1 and Corollary 1.2 in Section 4. We start by proving the following result, which provides a numerically explicit lower bound for the implicit constant in the error term in (1.3). As we already mentioned, our method can easily be adapted to yield a numerically explicit upper bound as well, though it will not be needed in the present paper.
Proposition 2.1.
Define by
for . Let . For every positive integer , we define
Then , , and for all .
Proof.
Let . Suppose first that and set
for . By [D, Theorem 5.6]111In [B] it is claimed that the proof of [D, Theorem 4.2] is incorrect due to the application of an incorrect zero density estimate of Ramaŕe [Rama, Theorem 1.1]. In a footnote on p. 2299 of the same paper, the authors state that the bounds asserted in [D] are likely affected for this reason. However, since they also give a correct proof of [D, Theorem 4.2] (see [B, Corollary 11.2]), one verifies easily that the proof of [D, Theorem 5.6], which relies only on [D, Theorem 4.2], partial summation, and numerical computation, remains valid., we have
(2.1)
for all , where . We shall also make use of the following inequality [D, Corollary 5.2]222For the same reason mentioned above, it is reasonable to suspect that the bounds given in [D, Corollary 5.2] are also affected. However, one can verify these bounds without much difficulty. Indeed, (5.2) of [D, Corollary 5.2] is superseded by [RS, Corollary 1], while (5.3) and (5.4) of [D, Corollary 5.2] follow from [BD, Lemmas 3.2–3.4] and direct calculations.:
(2.2)
where and . We start with the range . In this range, we have
where denotes the total number of prime factors of , with multiplicity counted.
Since
Now we proceed to bound for recursively when . Let be arbitrary. It is easily seen that the following variant of Buchstab’s identity (1.2) holds for any :
(2.6)
where is any real number sufficiently close to . For and , we obtain by taking that
(2.7)
We have already shown that
(2.8)
Note that . Thus, we have
Since is continuous on , it follows from (2.7) and (2.8) that
By [T, (6.23), p. 562] and [T, Theorems III.5.7 & III.6.6], we have, for all , that
where is the Dickman-de Bruijn function defined to be the unique continuous solution to the delay differential equation for , subject to the initial value condition for . Moreover, we have
Combining (2.9), (2.10) and (2.11), we deduce that
for . Therefore, for all , where
Consequently, we have and for all .
Suppose now that . By [RS, Theorem 20] we can replace (2.1) with
where . Moreover, (2.2) remains true if we replace and by and , respectively, according to [D, Corollary 5.2]. With these changes, we run the same argument used to handle the case and get
when and
when , so that we can take
As a consequence, we have , and for all . This completes the proof of the proposition.
∎
The next result provides a numerical lower bound for on .
Lemma 2.2.
We have for all .
Proof.
Consider first the case . Since for and for , we have
for . Note that , where
Since
we know that is strictly increasing on and strictly decreasing on , where is the unique solution to the equation . But and
It follows that has a unique zero . The numerical value of is given by , according to Mathematica. Hence for and for . The same is true for , which implies that is strictly decreasing on and strictly increasing on . Thus, for .
Consider now the case . It is known [JR] that satisfies
for all . Since is strictly decreasing on , we have for all . To find the value of , we use for and for to obtain
for . It follows that
for all . We have therefore shown that for all .
∎
We are now ready to prove the following clean lower bound for that we alluded to.
Theorem 2.3.
We have uniformly for all .
Proof.
In the range , we have trivially . By [D, Corollary 5.2] we have
whenever . Furthermore, we have verified for with using Mathematica. Hence, holds in the range .
Consider now the case . Following the proof of Proposition 2.1, we have
(2.12)
where
To handle the sum in (2), we appeal to Theorem 5 and its corollary from [RS] to arrive at
in the range . By [RS, Corollary 1] we have
provided that . The right-hand side of the above can be estimated in the same way as in the proof of Proposition 2.1, so we obtain
On the other hand, we see by [D, Corollary 5.2] and [RS, Corollary 2] that
for . Collecting the estimates above and using the inequality for , we find that
for all . For with , we have verified the inequality directly through numerical computation.
Next, we consider the range . By Proposition 2.1 and Lemma 2.2 we have
provided that . To deal with the range , we follow the inclusion-exclusion technique used in [FP, Section 3]. For any integer , let denote the number of distinct prime factors of . We start by “pre-sieving” with the primes 2, 3, and 5: for any the number of integers
with is , where . Let be the product of the primes in . Then we have by the Bonferroni inequalities that
where
By Newton’s identities, the inner sum in the definition of can be represented in terms of the power sums of over all primes . Thus, we have whenever and . Using Mathematica, we find that the inequality holds for and . Finally, we have verified the inequality directly for with by numerical calculations, completing the proof of our theorem.
∎
Remark 2.1.
Note that for we have
provided that . Combined with Theorem 2.3 and numerical examination of the case , this implies that the inequality holds in the slightly larger range if one assumes .
3. An Explicit Version of de Bruijn’s Estimate
To prove Theorem 1.1, we shall first develop an explicit version of (1.6) with a general , following [Br], where is a positive decreasing function satisfying the same conditions described in the introduction. Suppose that . For each , put
We start by estimating for . Using a Stieltjes integral, we may write
(3.1)
where . The first integral on the right-hand side of the above is equal to
Since
for all , we have
But a change of variable shows that
where we have used the inequality for and . It follows that
(3.2)
Now we estimate the second integral on the right-hand side of (3.1). By (1.4) and partial integration we have
where . Thus, one can think of as a smooth approximation to . Since we also expect to be a smooth approximation to , in view of (3.11) it is reasonable to expect
to be small in size as a function of . This can be easily verified when . Following de Bruijn [Br], we have
(3.12)
Since
we find
Recall that for with the obvious extension for . It follows that
which will later be used to estimate . To estimate , let us write , where
Then we expect to be small in size as a function of . Using (3.10) and the observation that , we have
(3.15)
Note that
By Theorems III.5.7 and III.6.6 in [T] we have
(3.16)
for all . It follows that
(3.17)
This inequality will later be used in conjunction with the formulas
(3.18)
and
(3.19)
On the other hand, we have
which implies that
By partial integration, the right side of the above is easily seen to be
Hence, we arrive at
Furthermore, we have by Fubini’s theorem that
the right side of which is easily seen to be
It follows that
(3.20)
This estimate together with (3.17) will lead us to a good estimate for .
Now we derive estimates for that suit our needs. Suppose that and take , where is a positive integer. We first consider the case . In view of (3.18), we see that (3.17) simplifies to
for . By (3.20) we have
since for . Combining these estimates with (3.13) and (3.15), we obtain for and , where
Now we handle the case . From (3.16)–(3.19) it follows that
where we have used the fact that for . By (3.16) and (3.20) we have
Together with (3.13) and (3.15), these inequalities imply that for and , where
As a direct corollary, we obtain
where we have applied partial summation to derive
For computational purposes, we can transform the last integral above by observing that
Let
be the lower incomplete gamma function, where with and . It is well known that
from which it follows that
Thus we obtain
(3.21)
In Mathematica, the function can be evaluated by “Gamma[t+2,0,1]”.
Finally, we are ready to estimate . Let
for and , where the value of is provided by (3.8). Using (3.14) and the estimates for with and , we find
for all and , from which we derive
for all and . Since is decreasing on , we have therefore shown that
(3.22)
for all , where the infinite sum can be evaluated using (3.21). To derive an explicit version of de Bruijn’s result (1.6), we observe that (3.6), (3.22) and [RS, Theorem 23] imply that for all , where
Now we apply (3.23) to obtain explicit estimates for with specific choices of . Unconditionally, it has been shown [MT, Corollary 2] that
for all . With , the function
is strictly decreasing on and satisfies (1.4) and (1.5) with
since
for . Numerical computation using Mathematica allows us to conclude that
(4.1)
for all . Suppose now that . Using the inequalities [F, Theorem], [RS, Theorem 23] and , we have
for all . Combining this with (4.1) proves the first half of Theorem 1.1.
Under the assumption of the Riemann Hypothesis,
it is known [S, Corollary 1] that
for all . With and
we have
for , where
Therefore, we conclude by (3.23) and numerical calculations that
(4.2)
for all . The values of relevant constants are recorded in the table below.
Table: Numerical Constants
constants
unconditional estimates
conditional estimates
229
2,657
.156576
.097363
.047992
.001351
2.156096
1.171019
.317985
.120362
2.534430
1.279593
.571800
.228936
2.548436
1.279593
.575723
.228940
3.110976
1.362717
.579718
.228971
2.548436
1.279593
.575723
.228940
3.131827
1.362717
.583750
.228975
2.534430
1.279593
.571800
.228936
3.110976
1.362717
.579718
.228971
16.982691
9.079975
4.638553
2.967998
6.236726
3.628074
2.697198
2.229726
10.745960
4.388310
1.941356
.737355
To complete the proof of the second half of Theorem 1.1, it remains to deal with the case . For simplicity of notation we set
Using Mathematica we find that
If , then
Note that . Since for by [RS, Theorem 16] and
for by [RS, Theorem 23], we have
(4.3)
where we have used the fact that is strictly decreasing on . Numerical computation shows that the right side of (4.3) is for . Suppose now that . By [FP, Theorem 1], Theorem 2.3 and [RS, Theorem 23] we have, for ,
This settles the case and completes the proof of Theorem 1.1.
The proof of Corollary 1.2 is similar, and we shall only sketch it. When , where for the unconditional estimate and for the conditional estimate, we have by the triangle inequality that
Then we bound using the values of listed in the table above. To estimate the second term, we use (3.6) when and the inequality
when , where is given by
according to [RS, Theorem 23] and Mathematica. This leads to the asserted bounds for . Suppose now that . In this case, the proof of the unconditional bound is exactly the same as that of the unconditional bound in Theorem 1.1. As for the conditional bound, we argue in the same way as in the proof of Theorem 1.1 to get
when and
when . Together, these inequalities yield the asserted conditional bound.
Remark 4.1.
The bounds in Theorem 1.1 and its corrollary may be improved. For example, the numerical values of the sum may be reduced by keeping (or even ) in all of the relevant integrals, but of course the computational complexity is expected to increase as a cost. In addition, our method would allow an extension of the range in the second half of Theorem 1.1 to the entire range if we argue with replaced by some smaller value and enlarge the constant 0.449774.
Acknowledgment. The author would like to thank his advisor C. Pomerance for his helpful comments and suggestions.