• edited by
11,686 views
34 34 votes

What is the cardinality of the set of integers $X$ defined below?

$X=\{n \mid 1 \leq n ≤ 123, n$ is not divisible by either $2$, $3$ or $5\}$

  1. $28$
  2. $33$
  3. $37$
  4. $44$

3 Answers

Best answer
71 71 votes

Number’s divisible by $2$ in $X = 61$        [ = integer(123/2) ]

Number’s divisible by $3$ in $X = 41$ 

Number’s divisible by $5$ in $X = 24$

Number’s divisible by $2$ and $3$ i.e. by $6 = 20$ 

Number’s divisible by $2$ and $5$ i.e by $10 = 12$

Number’s divisible by $3$ and $5$ i.e by $15 = 8$ 

Number’s divisible by $2$ and $3$ and $5$ i.e by $30 = 4$ 

Number’s divisible by either $2$ or $3$ or $5$ = $N(AUBUC)$ = $N(A) +N(B)+N(C) -N(A∩B)-N(B∩C)-N(A∩C)+ N(A∩B∩C) $

$= 61 +41+24 -20-12-8 +4 = 90$ 

$X$={ $n ,1 ≤ n ≤ 123, n$ is not divisible by either $2, 3$ or $5$ }  

Cardinality = $123-90$ =$33$

Correct Answer: $B$

• edited by
4 4 votes
Number of elements that are divisible by a and b in between 1 to n are = $\left \lfloor n/(l.c.m(a.b))\right \rfloor$.
Answer:
Position:
Show:

Related questions

38 38 votes
5 answers 5 answers
10.3k
10.3k views
Ishrat Jahan asked Oct 31, 2014
10,310 views
Let $P$, $Q$ and $R$ be sets let Δ denote the symmetric difference operator defined as $PΔQ=(P \cup Q) - (P ∩ Q).$ Using Venn diagrams, determine which of the following i...
53 53 votes
5 answers 5 answers
13.2k
13.2k views
Ishrat Jahan asked Oct 31, 2014
13,217 views
Given a boolean function $f (x_1, x_2, \ldots, x_n),$ which of the following equations is NOT true?$f (x_1, x_2, \ldots, x_n) = x_1'f(x_1, x_2, \ldots, x_n) + x_1f(x_1, x...
61 61 votes
5 answers 5 answers
21.0k
21.0k views
Ishrat Jahan asked Oct 30, 2014
20,981 views
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all...
88 88 votes
10 answers 10 answers
21.0k
21.0k views
Rucha Shelke asked Sep 18, 2014
20,982 views
Given a set of elements $N = {1, 2, ..., n}$ and two arbitrary subsets $A⊆N$ and $B⊆N$, how many of the n! permutations $\pi$ from $N$ to $N$ satisfy $\min(\pi(A)) = \min...