Coprime distribution

Given 2 randomly generated positive integers a a and b b , the probability that they are coprime i.e. gcd ( a , b ) = 1 \text{gcd}(a,b)=1 can be written as P P . If P P can be written as a b π c \dfrac {a}{b \pi^c} , find a + b + c a + b + c where the fraction has been reduced to lowest terms.


The answer is 9.

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.

1 solution

Nihar Mahajan
Jun 14, 2015

I don't have my own proof , but you can refer this page .

Interestingly, the answer is ( k = 1 1 k 2 ) 1 \left(\sum_{k=1}^{\infty}\dfrac{1}{k^2}\right)^{-1} there is a great proof that utilizes this fact.

Daniel Liu - 6 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...