What is the probability that natural numbers chosen at random have no factor in common?
Note : 1 isn't counted as common factor.
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.
This is a classic number theory problem. Two numbers have no factor in common if and only if they have no prime factor in common. For two fixed integers, the probability that one of them has a prime p as a factor is p 1 . Thus, the probability that they share p as a factor is p 2 1 and the probability that they don't have common factor p is 1 − p 2 1 . The probability that they have no prime factors in common is simply the product over all primes p :
p prime ∏ 1 − p 2 1 = p prime ∏ ( 1 − p 2 1 1 ) − 1 = ⎝ ⎛ p prime ∏ ( n = 1 ∑ ∞ p 2 n 1 ) ⎠ ⎞ − 1 = ⎝ ⎛ p prime ∏ ( 1 + p 2 1 + p 4 1 + ⋯ ) ⎠ ⎞ − 1 = ( ( 1 + 2 2 1 + 2 4 1 + ⋯ ) ( 1 + 3 2 1 + 3 4 1 + ⋯ ) ( 1 + 5 2 1 + 5 4 1 + ⋯ ) ) − 1 = ( 1 + 2 2 1 + 3 2 1 + 4 2 1 + ⋯ ) − 1 = ( 6 π 2 ) − 1 = π 2 6 ≈ 0 . 6 0 7 9 1 − p 2 1 1 is the closed form of a geometric series ( 1 ) By the Fundamental Theorem of Arithmetic ( 2 ) By the Basel Problem
(1) When the expression in the preceding line is expanded, the product p 1 2 m 1 p 2 2 m 2 ⋯ 1 = ( p 1 m 1 p 2 m 2 ⋯ ) 2 1 (where p k denotes the k th prime) will appear precisely once for each ( m 1 , m 2 , … ) ∈ N ∞ . By the Fundamental Theorem of Arithmetic, these terms correspond precisely to the natural numbers, and n 2 1 will appear in the sum precisely once for each n ∈ N .
(2) Finding a closed form for this sum is the famous Basel Problem , first solved by Leonard Euler in 1734. The most straightforward proof involves manipulating the Taylor Series for x sin x , and can be found on the linked page.