Let $S = \{1, 2, 3, \ldots, 40\}$ and let $A$ be a subset of $S$ such that no two elements in $A$ have their sum divisible by $5$. What is the maximum number of elements possible in $A$?

  • A
    $10$
  • B
    $13$
  • C
    $17$
  • D
    $20$

Explore More

Similar Questions

Let $S = \{4, 6, 9\}$ and $T = \{9, 10, 11, \ldots, 1000\}$. If $A = \{a_{1} + a_{2} + \ldots + a_{k} : k \in N, a_{1}, a_{2}, \ldots, a_{k} \in S\}$,then the sum of all the elements in the set $T - A$ is equal to:

The sum of all integers from $1$ to $100$ that are divisible by $2$ or $5$ is...........

Difficult
View Solution

Let $A = \{1, 2, 3, 4, 5, 6, 7\}$ and $B = \{3, 6, 7, 9\}$. Then the number of elements in the set $\{ C \subseteq A : C \cap B \neq \phi \}$ is

The sum of all the elements of the set $\{\alpha \in \{1, 2, \ldots, 100\} : \operatorname{HCF}(\alpha, 24) = 1\}$ is

If $A$ and $B$ are events of a random experiment with $P(A) = 0.5$,$P(B) = 0.4$ and $P(A \cap B) = 0.3$,then the probability that neither $A$ nor $B$ occurs is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo