# ISI2015-MMA-11

1 vote
214 views

The number of positive integers which are less than or equal to $1000$ and are divisible by none of $17$, $19$ and $23$ equals

1. $854$
2. $153$
3. $160$
4. none of the above

retagged

1 vote

Answer: $\mathbf A$

Explanation:

This can be solved using the inclusion-exclusion principle and Demorgan's Law:

$|\bar {A}| \cap \bar {|B|}\cap \bar {|C|} = 1000 - |A\cap B\cap C|= 1000 - (|A| + |B|+|C|) + (|A|\cap | B|) + (|B|\cap | C|) + |C|\cap |A|) - |A\cap B\cap C|\tag{1}$

$|A| = \Big\lfloor {\frac{1000}{17}}\Big \rfloor = 58$

$|B| = \Big\lfloor {\frac{1000}{19}}\Big \rfloor = 52$

$|C| = \Big\lfloor {\frac{1000}{23}}\Big \rfloor = 43$

$|A\cap B| = \Big\lfloor {\frac{1000}{17.19}}\Big \rfloor = 3$

$|B\cap C| = \Big\lfloor {\frac{1000}{19.23}}\Big \rfloor = 2$

$|C\cap A| = \Big\lfloor {\frac{1000}{23.17}}\Big \rfloor = 2$

$|A\cap B \cap C| = \Big\lfloor {\frac{1000}{17.19.23}}\Big \rfloor = 0$

On substituting these values in $\mathrm {{eq}^n} \; (1)$, we get:

Answer $=1000 -( 58+52+43)+3+2+2 = 854$

$\therefore \mathbf A$ is the correct option.

edited by

## Related questions

1
103 views
Let $k$ and $n$ be integers greater than $1$. Then $(kn)!$ is not necessarily divisible by $(n!)^k$ $(k!)^n$ $n! \cdot k! \cdot$ $2^{kn}$
1 vote
Let $S=\{0, 1, 2, \cdots 25\}$ and $T=\{n \in S: n^2+3n+2$ is divisible by $6\}$. Then the number of elements in the set $T$ is $16$ $17$ $18$ $10$
Let $a$ be the $81$ – digit number of which all the digits are equal to $1$. Then the number $a$ is, divisible by $9$ but not divisible by $27$ divisible by $27$ but not divisible by $81$ divisible by $81$ None of the above
Suppose a 6 digit number $N$ is formed by rearranging the digits of the number 123456. If $N$ is divisible by 5, then the set of all possible remainders when $N$ is divided by 45 is $\{30\}$ $\{15, 30\}$ $\{0, 15, 30\}$ $\{0, 5, 15, 30\}$