Trophy ready for the winner !

From the set { 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } \{2,3,4,5,6,7,8,9\} , how many non-ordered pairs of co-primes can be formed ?


Join the Brilliant Classes and enjoy the excellence. Also checkout Foundation Assignment #2 for JEE.
20 18 19 None of the given choices 22 21

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.

3 solutions

Chew-Seong Cheong
May 20, 2015

All the non-ordered pairs of coprimes within { 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } \{2,3,4,5,6,7,8,9\} are listed below:

2 : 3 5 7 9 4 3 : 4 5 7 8 4 4 : 5 7 9 3 5 : 6 7 8 9 4 6 : 7 1 7 : 8 9 2 8 : 9 1 \begin{array} {lcccccccl} 2: & 3 & \color{#D61F06}{\not{4}} & 5 & \color{#D61F06}{\not{6}} & 7 & \color{#D61F06}{\not{8}} & 9 &\Rightarrow 4 \\ 3: & & 4 & 5 & \color{#D61F06}{\not{6}} & 7 & 8 & \color{#D61F06}{\not{9}} &\Rightarrow 4 \\ 4: & & & 5 & \color{#D61F06}{\not{6}} & 7 & \color{#D61F06}{\not{8}} & 9 & \Rightarrow 3 \\ 5: & & & & 6 & 7 & 8 & 9 & \Rightarrow 4 \\ 6: & & & & & 7 & \color{#D61F06}{\not{8}} & \color{#D61F06}{\not{9}} & \Rightarrow 1 \\ 7: & & & & & & 8 & 9 & \Rightarrow 2 \\ 8: & & & & & & & 9 & \Rightarrow 1 \\ \end{array}

There are altogether 4 + 4 + 3 + 4 + 1 + 2 + 1 = 19 4+4+3+4+1+2+1 = \boxed{19} coprimes.

A l t e r n a t i v e S o l u t i o n \large \color{#3D99F6}{\underline{Alternative \space Solution}}

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 1 p ) \varphi (n) = n \displaystyle \prod_{p|n} {\left(1-\frac{1}{p}\right)} , where p p is a prime, gives the number of positive coprimes of a positive integer n n less than n n .

Since the sequence starts with 2 2 instead of 1 1 , the number of coprimes of n n has to less 1 -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 1 p ) ] n = 2 9 1 = 2 ( 1 1 2 ) + 3 ( 1 1 3 ) + 4 ( 1 1 2 ) + 5 ( 1 1 5 ) + 6 ( 1 1 2 ) ( 1 1 3 ) + 7 ( 1 1 7 ) + 8 ( 1 1 2 ) + 9 ( 1 1 3 ) 8 = ( 2 + 4 + 8 ) ( 1 2 ) + ( 3 + 9 ) ( 2 3 ) + 5 ( 4 5 ) + 6 ( 1 2 ) ( 2 3 ) + 7 ( ( 6 7 ) 8 = 7 + 8 + 4 + 2 + 6 8 = 19 \begin{aligned} N & = \displaystyle \sum_{n=2}^9 {(\varphi (n)-1)} \\ & = \sum_{n=2}^9 { \left[ n \prod_{p|n} {\left(1-\frac{1}{p} \right)} \right]} - \sum_{n=2}^9 {1} \\ & = 2\left(1-\frac{1}{2} \right) + 3\left(1-\frac{1}{3} \right) + 4\left(1-\frac{1}{2} \right) + 5\left(1-\frac{1}{5} \right)\\ & \quad + 6\left(1-\frac{1}{2} \right)\left(1-\frac{1}{3} \right)+7\left(1-\frac{1}{7} \right) + 8\left(1-\frac{1}{2} \right) \\ & \quad + 9\left(1-\frac{1}{3} \right) - 8 \\ & = (2+4+8)\left(\frac{1}{2}\right) +(3+9)\left(\frac{2}{3}\right) + 5\left(\frac{4}{5}\right) +6\left(\frac{1}{2}\right)\left(\frac{2}{3}\right) \\ & \quad +7(\left(\frac{6}{7}\right) - 8 \\ & = 7+8+4+2+6-8 \\ & = \boxed{19} \end{aligned}

sir, is there any formular for doing this or we have to do it just by trail and error??????????

Abhisek Mohanty - 6 years ago
Panya Chunnanonda
May 23, 2015

In set (2, 3, 4, 5, 6, 7, 8, 9), there are totally 8C2= 28 non- ordered pairs can be formed. In set (2, 4, 6, 8), there are 4C2= 6 non- ordered pairs can be formed. And, in set ( 3, 6, 9), there are 3C2= 3 non- ordered pairs can be formed. So, non- ordered pairs of co- primes can be formed= 28- 6- 3= 19.

Kalpok Guha
May 20, 2015

There are 7 integers greater than 2.4 out of them are co-prime with 2 (3,5,7,9)

6 integers are greater than 3,4 of them are co-prime with 3 (4,5,7,9)

5 integers are greater than 4,3 of them are co-prime with 4 (5,7,9)

All the 4 integers greater than 5 are co-prime with 5.

In case of 6,only 7 is co-prime with it.

8 and 9 are co-prime with 7.

8 is co-prime with 9 .

So the total is 4 + 4 + 3 + 4 + 1 + 2 + 1 = 19 4+4+3+4+1+2+1=19

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...