• edited by
3,948 views
19 19 votes

A subset $S$ of set of numbers $\{2,3,4,5,6,7,8,9,10\}$ is said to be good if has exactly $4$ elements and their $gcd=1$, Then number of good subset is

  1. $126$
  2. $125$
  3. $123$
  4. $121$

4 Answers

Best answer
26 26 votes

$S = \{2,3,4,5,6,7,8,9,10\} , |S| = 9$

Total no of subsets with cardinality $4 = C(9 , 4 ) = 126$

The subsets with cardinality $4$ which having $gcd \neq 1$ is possible only when subset contains only even numbers.

Here even no $E = \{2,4,6,8,10\}$ 

No. of subsets with cardinality $4$ from set $E = C(5 , 4) = 5$.

  1. $\{2,4,6,8\}$
  2. $\{2,4,6,10\}$
  3. $\{2,4,8,10\}$
  4. $\{2,6,8,10\}$
  5. $\{4,6,8,10\}$

So,there are $5$ subsets which having $gcd = 2$  i.e  $gcd \neq 1$ 

So, Total no subsets with cardinality $4$ which having $gcd = 1$  is $126 - 5 =121$

The correct answer is (D)121

• edited by
5 5 votes
Selecting $4$ numbers from $9$ is $^9C_4 = 126.$
We have to subtract all the cases where gcd of all numbers is $1$ and this can only happen when all number should not be even. Which is $^5C_4=5$
So answer will be $126-5=121.$
• edited by
2 2 votes
Total number of sub sets which will contain exactly 4 elements = 9C4= 126

Now eliminate all the sets of 4 elements which can cause GCD other than 1 ,here by observing only GCD of 2 can exist other than 1 with 4 elements and those 4 elements can be from {2,4,6,8,10}.

Thus with these 5 elements  5c4 = 5 sub sets are possible which have gcd other than 1.

So, good subsets = 126 - 5 = 121...
0 0 votes
Please tell what is wrong with this solution ...I am getting 6 !!!!!

 Numbers are 2,3,2^2,5,2*3,7,2^3,3^2,2*5

There are 4 prime numbers involved which are 2,3,5,7.

Since a good subset should have exactly 4 elements which are co-prime, those numbers must choose 1 of these primes as factors without repetition

That means we cannot have 2*3, and 2*5 in the good subset because it will force us to choose a factor twice.

Now , in the remaining numbers,

2 can be chosen from 2,2^2,2^3 ----- (3 ways)

3 can be chosen from 3,3^2------------(2 ways)

5 can be chosen from 5-------------------(1 way)

7 can be chosen from 7-------------------(1 way)

 So total number of "good" subsets = 3*2*1*1=6
Position:
Show:

Related questions

14 14 votes
5 answers 5 answers
4.8k
4.8k views
Tesla! asked Apr 3, 2017
4,837 views
The number of permutation of $\{1,2,3,4,5\}$ that keep at least one integer fixed is.$81$$76$$120$$60$
21 21 votes
5 answers 5 answers
4.8k
4.8k views
Tesla! asked Apr 3, 2017
4,754 views
In how many ways can three person, each throwing a single die once, make a score of $11$$22$$27$$24$$38$
14 14 votes
3 answers 3 answers
3.9k
3.9k views
Tesla! asked Apr 3, 2017
3,908 views
A club with $x$ members is organized into four committees such that each member is in exactly two committees,any two committees have exactly one member in common .Then $x...
3 3 votes
2 2 answers
1.3k
1.3k views
Tesla! asked Apr 5, 2017
1,290 views
Let $X$ be a nonempty set and let $\mathcal{P}(X)$ denote the collection of all subsets of $X.$ Define $\textit{f}:\textit{X$\times$ $\mathcal{P}$(X)}\rightarrow \mathbb{...