The probability that a random integer between 1 and will have its greatest
prime factor
approaches a limiting value as , where for and is defined through the integral
equation

which is precisely the Golomb-Dickman constant , which is defined in a completely
different way!

The Dickman function can be solved numerically by converting it to a delay differential equation. This can be done by noting that will become upon multiplicative inversion, so define to obtain

(10)

Now change variables under the integral sign by defining

Dickman, K. "On the Frequency of Numbers Containing Prime Factors of a Certain Relative Magnitude." Arkiv för Mat., Astron.
och Fys.22A, 1-14, 1930.Knuth, D. E. The
Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 3rd ed.
Reading, MA: Addison-Wesley, pp. 382-384, 1998.Norton, K. K.
Numbers
with Small Prime Factors, and the Least kth Power Non-Residue.
Providence, RI: Amer. Math. Soc., 1971.Panario, D. "Smallest Components
in Combinatorial Structures." Feb. 16, 1998. http://algo.inria.fr/seminars/sem97-98/panario.pdf.Ramaswami,
V. "On the Number of Positive Integers Less than and Free of Prime Divisors Greater than ." Bull. Amer. Math. Soc.55, 1122-1127,
1949.Ramaswami, V. "The Number of Positive Integers and Free of Prime Divisors , and a Problem of S. S. Pillai." Duke
Math. J.16, 99-109, 1949.