Number of Irreducible Fractions

Find the number of distinct fractions a b \dfrac{a}{b} , where both a a and b b are integers with 0 a b 50 0\leq a \leq b \leq 50 and gcd ( a , b ) = 1 \gcd(a,b)=1 .

Note: It's acceptable if a b \dfrac{a}{b} equals some integer.

Notation: gcd ( ) \gcd(\cdot) denotes the greatest common divisor function.


The answer is 775.

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

Maria Kozlowska
Jan 25, 2017

Euler totient function can be used here. For every b b , totient function will give us number of coprime a a 's. For a = 0 , b = 1 a=0, b=1 we need to add 1 to the result.

b = 1 50 ϕ ( b ) + 1 = 774 + 1 = 775 \sum_{b=1}^{50} \phi(b) +1 = 774+1=\boxed{775}

Can we compute this stuff fast? Without a calculator?

Dang, I didn't think about adding 1 to solution, so I answered 774 and got it wrong.

Kok Hao - 4 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...