Find the number of distinct fractions , where both and are integers with and .
Note: It's acceptable if equals some integer.
Notation: denotes the greatest common divisor function.
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.
Euler totient function can be used here. For every b , totient function will give us number of coprime a 's. For a = 0 , b = 1 we need to add 1 to the result.
b = 1 ∑ 5 0 ϕ ( b ) + 1 = 7 7 4 + 1 = 7 7 5