What is the probability that integers selected at random are have no factor that divides all of them?
Note : 1 isn't meant to be counted
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
For more detail, see the solution to the two integer case, as the proof is virtually identical.
Three integers have no common factor if an only if they have no common prime factor. For three fixed integers and a given prime p , this has probability 1 − p 3 1 . Thus, we compute
p prime ∏ 1 − p 3 1 = p prime ∏ ( 1 − p 3 1 1 ) − 1 = ⎝ ⎛ p prime ∏ ( n = 1 ∑ ∞ p 3 n 1 ) ⎠ ⎞ − 1 = ⎝ ⎛ p prime ∏ ( 1 + p 3 1 + p 6 1 + ⋯ ) ⎠ ⎞ − 1 = ( ( 1 + 2 3 1 + 2 6 1 + ⋯ ) ( 1 + 3 3 1 + 3 6 1 + ⋯ ) ( 1 + 5 3 1 + 5 6 1 + ⋯ ) ) − 1 = ( 1 + 2 3 1 + 3 3 1 + 4 3 1 + ⋯ ) − 1 = ( n = 1 ∑ ∞ n 3 1 ) − 1 = ( ζ ( 3 ) ) − 1 ≈ ( 1 . 2 0 2 ) − 1 ≈ 0 . 8 3 1 9 Where ζ ( s ) is the Reimann zeta function ( 1 ) Ap e ˊ ry’s constant
(1) To my knowledge, there is no straightforward way to compute ζ ( 3 ) , otherwise known as Apéry's constant.