Find the number of ordered pairs of when and are coprime positive integers that satisfy
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.
Here we would use Euler's totient function
It gives us the no. of numbers coprime to a no. "M"
i.e φ M = No. of numbers coprime to M
So φ 1 1 5 9 2 6 5 8 = 4 5 1 6 5 6 0
The answer is
⇒ 4 5 1 6 5 6 0
I would love to see any other method