, how many non-ordered pairs of co-primes can be formed ?
From the set
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.
All the non-ordered pairs of coprimes within { 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } are listed below:
2 : 3 : 4 : 5 : 6 : 7 : 8 : 3 4 4 5 5 5 6 6 6 6 7 7 7 7 7 8 8 8 8 8 8 9 9 9 9 9 9 9 ⇒ 4 ⇒ 4 ⇒ 3 ⇒ 4 ⇒ 1 ⇒ 2 ⇒ 1
There are altogether 4 + 4 + 3 + 4 + 1 + 2 + 1 = 1 9 coprimes.
A l t e r n a t i v e S o l u t i o n
There is another solution using Euler's totient function, which I have just learnt. Thanks to Abhisek Mohanty for asking the right question.
Euler's totient function φ ( n ) = n p ∣ n ∏ ( 1 − p 1 ) , where p is a prime, gives the number of positive coprimes of a positive integer n less than n .
Since the sequence starts with 2 instead of 1 , the number of coprimes of n has to less − 1 . And the number of unordered pairs of coprimes is given by:
N = n = 2 ∑ 9 ( φ ( n ) − 1 ) = n = 2 ∑ 9 ⎣ ⎡ n p ∣ n ∏ ( 1 − p 1 ) ⎦ ⎤ − n = 2 ∑ 9 1 = 2 ( 1 − 2 1 ) + 3 ( 1 − 3 1 ) + 4 ( 1 − 2 1 ) + 5 ( 1 − 5 1 ) + 6 ( 1 − 2 1 ) ( 1 − 3 1 ) + 7 ( 1 − 7 1 ) + 8 ( 1 − 2 1 ) + 9 ( 1 − 3 1 ) − 8 = ( 2 + 4 + 8 ) ( 2 1 ) + ( 3 + 9 ) ( 3 2 ) + 5 ( 5 4 ) + 6 ( 2 1 ) ( 3 2 ) + 7 ( ( 7 6 ) − 8 = 7 + 8 + 4 + 2 + 6 − 8 = 1 9