# Dickman function

The function $\rho(u)$ defined on $(0, \infty)$ by the initial condition $\rho(u) = 1$ for $0 < u \le 1$ and by the differential-delay equation $u \rho'(u) = -\rho(u-1)$ for $u > 1$. Interest attaches to this function because of its connection to "smooth" numbers, i.e. numbers that are the product of many small prime numbers. Let $\Psi(x,y)$ denote the number of positive integers less than or equal to $x$ and free of prime divisors greater than $y$. When $x$ is much larger than $y$, it is a simple matter of inclusion-and-exclusion counting (cf. also Inclusion-exclusion formula) to show that $\Psi(x,y) \approx x \prod_{p \le y} (1-1/p)$, where $p$ denotes a prime number. But the error terms grow rapidly, and the "main" term gives the wrong answer in the ranges of greatest interest, including the case when $y$ is comparable to a fixed fractional power of $x$. For this case, K. Dickman found that $\lim_{x\to\infty} x^{-1} \Psi(x,x^{1/u}) = \rho(u)$. If, in place of the restriction $p \le y$ for $p|n$ one takes the condition $p > y$, the resulting $\Phi(x,y)$ is approximated by $x\omega(u)/\log y$, where $\omega(u)$ is the Buchstab function, defined by $\omega(u) = 1/u$, $1\le u\le 2$, and $(u\omega(u))' = \omega(u-1)$, $u \ge 2$, where for $u=2$ the right-hand derivative has to be taken, [a1]. Unlike $\rho$, $\omega$ oscillates and tends to a positive limit, equal to $e^{-\gamma}$.

There are two combinatorial identities linking the Dickman function to $\Psi(x,y)$. Early work is based on the Buchstab identity: With $p$ denoting a prime number, for $y < z < x$,

$$\Psi(x,y) = \Psi(x,z) - \sum_{z< p\le y} \Psi\left(\frac xp, p \right).$$

The usual heuristic device of replacing a sum over prime numbers by an integral with "prime density" $1/\log t$ and replacing $\Psi(r,s)$ with $r\rho(\log r/\log s)$ leads to an identity which, when $y=x^{1/u}$ and $z=x^{1/(u-1)}$, simplifies to an integral equivalent to the definition of $\rho(u)$. N.G. de Bruijn carried this idea to its limits in [a2], but accuracy suffers when large and comparable estimated quantities must be subtracted. The more recent Hildebrand identity involves only additions and has the further advantage that the second input is the same $y$ throughout:

$$\Psi(x,y) \log x = \int_1^x \Psi(t,y) \frac{dt}{t} + \sum_{\substack{p^m \le x \\ p\le y}} \Psi \left( \frac{x}{p^m}, y\right) \log p.$$

Applications require estimates uniform in $u$; the best known estimate along these lines, due to A. Hildebrand and based on the identity above, is

$$\Psi(x,y) = x \rho(u) \left( 1 + O_\epsilon \left( \frac{\log(u+1)}{\log y} \right)\right)$$

uniformly in $y\ge 2$ and $1\le u\le \exp(\log^{(3/5)-\epsilon} y)$. There are similar results for algebraic integers, [a3].

There are also results concerning the number of smooth integers in an interval, and concerning the distribution of smooth integers into congruence classes [a4], [a5].

The Riemann hypothesis (cf. Riemann hypotheses) implies $\Psi(y^u, y) = y^u \rho(u) \exp(O_\epsilon (\log(u+1)/\log y))$ [a8].

The analytical properties of $\rho$ are reasonably well understood; calculus, analysis of the Laplace transform, and the saddle-point method are the key tools. The first extensive analysis is due to De Bruijn, and the function $\rho(u)$ is sometimes termed the Dickman–De Bruijn function. One has [a10]:

a) $u\rho(u) = \int_{u-1}^u \rho(v) \, dv$ for $u\ge 1$ (so that $\rho$ is positive for all positive $u$, and hence, from the definition, decreasing);

b) $\rho(u)$ is log-concave, that is, $\rho(tu+(1-t)v) \ge \rho^t(u)\rho^{1-t}(v)$ for $u,v>0$ and $0\le t\le 1$ (K. Alladi);

c) The Laplace transform

$$\mathcal{L} \rho(s) := \int_0^\infty e^{-su} \rho(u) \, du = \frac{1}{s} \exp \left[ -\int_s^\infty t^{-1} e^{-t} \, dt \right] = \exp [\gamma - \operatorname{Ein}(s)];$$

d) $\rho(u) = \exp(-u(\log u + \log \log u - 1 + O(\log \log u/\log u)))$ as $u \to \infty$.

The Dickman function is one of a parameterized family of related functions $\rho_\tau(u)$, [a12], and a wider class of similar delay-differential equations has been studied in [a7]. A quick and simple bit of Mathematica code suffices to calculate $\rho$ to reasonable accuracy in the interval $0<u<8$ using step-size $\epsilon = 10^{-4}$. This code calculates a table of values of $\rho$ at intervals of length $\epsilon$, working back recursively into $(0,2]$:

<tbody> </tbody>
 $\rho[u_-,e_-]:=\rho[u,\epsilon]=$ $\text{Module}[\{\square\},$ $\text{If}[u\le 1, \text{Return}[1]];$ $\text{If}[u\le 2, , \text{Return}[N[1-\text{Log}[u]]];$ $\rho[u-\epsilon, \epsilon] - (\epsilon/2)(\rho[u-1-\epsilon, \epsilon]/(u-\epsilon) + \rho[u-1, \epsilon]/u)$ $]$

#### References

 [a1] N.G. de Bruijn, "On the number of positive integers $\leq x$ and free prime factors $> y$. II" Indag. Math. , 28 (1966) pp. 239–247 Nederl. Akad. Wetensch. Proc. Ser. A , 69 (1966) [a2] N.G. de Bruijn, "On the number of uncancelled elements in the sieve of Eratosthenes" Indag. Math. , 12 (1950) pp. 247–256 Nederl. Akad. Wetensch. Proc. , 53 (1950) pp. 803–812 [a3] J. Friedlander, "On the number of ideals free from large prime divisors" J. Reine Angew. Math. , 255 (1972) pp. 1–7 [a4] J. Friedlander, A. Granville, "Integers without large prime factors, in short intervals" Philos. Trans. Royal Soc. , 345 (1993) pp. 339–348 [a5] A. Granville, "On integers, without large prime factors, in arithmetic progressions II" Philos. Trans. Royal Soc. , 345 (1993) pp. 349–362 [a6] A. Hildebrand, G. Tenenbaum, "Integers without large prime factors" J. Théor. Nombres Bordeaux , 5 : 2 (1993) pp. 411–484 [a7] A. Hildebrand, G. Tenenbaum, "On a class of differential-difference equations arising in number theory" J. Anal. Math. , 61 (1993) pp. 145–179 [a8] A. Hildebrand, "Integers free of large prime factors and the Riemann hypothesis" Mathematika , 31 : 2 (1985) pp. 258–271 [a9] S. Hunter, J. Sorenson, "Approximating the number of integers free of large prime factors" Math. Comput. , 66 : 220 (1997) pp. 1729–1741 [a10] P. Moree, "Psixyology and Diophantine equations" Diss. Univ. Leiden (1993) [a11] E. Saias, "Sur le nombre des entiers sans grand facteur premier" J. Number Theory , 32 : 1 (1989) pp. 78–99 [a12] F.S. Wheeler, "Two differential-difference equations arising in number theory" Trans. Amer. Math. Soc. , 318 : 2 (1990) pp. 491–523 [a13] D.S. Mitrinović, J. Sandor, B. Crstici, "Handbook of number theory" , Kluwer Acad. Publ. (1996) pp. Sect. IV.21 [a14] K. Dickman, "On the frequency of numbers containing prime factors of a certain relative magnitude" Ark. Mat., Astron. och Fysik , 22A : 10 (1930) pp. 1–14
How to Cite This Entry:
Dickman function. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Dickman_function&oldid=55507
This article was adapted from an original article by D. Hensley (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article