OFFSET
0,1
COMMENTS
The asymptotic probability that the greatest common unitary divisor of three positive integers selected independently at random equals 1 (Tóth, 2014).
In general, the asymptotic probability that the greatest common unitary divisor of k positive integers selected independently at random equals 1 is Product_{p prime} (1 - (p-1)^k/(p^k*(p^k-1))).
LINKS
László Tóth, Multiplicative arithmetic functions of several variables: a survey, in: T. Rassias and P. Pardalos (eds.), Mathematics Without Boundaries: Surveys in Pure Mathematics, New York, NY: Springer New York, 2014, pp. 483-514; arXiv preprint, arXiv:1310.7053 [math.NT], 2013-2014. See Proposition 22, p. 507.
FORMULA
Equals zeta(3) * Product_{p prime} (1 - 2/p^3 + 3/p^4 - 3/p^5 + 1/p^6).
EXAMPLE
0.963764081460077154108621545444533216762123221644108...
PROG
(PARI) prodeulerrat(1 - (p-1)^3/(p^3*(p^3-1)))
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Amiram Eldar, Mar 10 2026
STATUS
approved
