Golomb–Dickman constant
From Wikipedia, the free encyclopedia
In mathematics, the Golomb–Dickman constant arises in the theory of random permutations and in number theory. Its value is
Let an be the average — taken over all permutations of a set of size n — of the length of the longest cycle in each permutation. Then the Golomb–Dickman constant is
In the language of probability theory, λn is the expected length of the longest cycle in a uniformly distributed random permutation of a set of size n.
In number theory, the Golomb–Dickman constant appears in connection with the average size of the largest prime factor of an integer. More precisely,
where P1(k) is the largest prime factor of k. So if k is a d digit integer, then λd is the asymptotic average number of digits of the largest prime factor of k.
The Golomb-Dickman constant appears in number theory in a different way. What is the probability that second largest prime factor of n is smaller than the square root of the largest prime factor of n? Asymptotically, this probability is λ. More precisely,
where P2(n) is the second largest prime factor n.
There are several expressions for λ. Namely,
where E1(t) is the exponential integral,
and
where ρ(t) is the Dickman function.
A related result is the one hundred prisoners problem in random permutation statistics: asymptotically, the fraction of permutations with a cycle of length greater than n/2 is
, or about 69%.
[edit] See also
[edit] External links
- Weisstein, Eric W., "Golomb-Dickman Constant" from MathWorld.
- Sloane's A084945 . The On-Line Encyclopedia of Integer Sequences (external link). AT&T Labs Research.
- Finch, Steven R. (2003). Mathematical Constants. Cambridge University Press. pp. 284–286. ISBN 0521818052. http://books.google.com/books?id=DL5iVYNoEa0C.






