If all the possible 3-digit numbers are forme | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) number is divisible by $3$ if the sum of its digits is divisible by $3$. The given digits are $S = \{1, 3, 5, 7, 9\}$.We need to choose $3$ digits

Vedclass · Accepted Answer

$24$

Vedclass · Answer

(D) number is divisible by $3$ if the sum of its digits is divisible by $3$. The given digits are $S = \{1, 3, 5, 7, 9\}$.We need to choose $3$ digits from $S$ such that their sum is a multiple of $3$.The possible sets of $3$ digits are:$1) \{1, 3, 5\} ightarrow 	ext{Sum} = 9$ (Divisible by $3$)$2) \{1, 5, 9\} ightarrow 	ext{Sum} = 15$ (Divisible by $3$)$3) \{3, 5, 7\} ightarrow 	ext{Sum} = 15$ (Divisible by $3$)$4) \{5, 7, 9\} ightarrow 	ext{Sum} = 21$ (Divisible by $3$)$5) \{1, 3, 9\} ightarrow 	ext{Sum} = 13$ (Not divisible by $3$)$6) \{1, 7, 9\} ightarrow 	ext{Sum} = 17$ (Not divisible by $3$)$7) \{3, 7, 9\} ightarrow 	ext{Sum} = 19$ (Not divisible by $3$)$8) \{1, 3, 7\} ightarrow 	ext{Sum} = 11$ (Not divisible by $3$)$9) \{1, 5, 7\} ightarrow 	ext{Sum} = 13$ (Not divisible by $3$)$10) \{3, 5, 9\} ightarrow 	ext{Sum} = 17$ (Not divisible by $3$)There are $4$ such sets of $3$ digits whose sum is divisible by $3$.Each set of $3$ distinct digits can be arranged in $3! = 6$ ways.Total numbers $= 4 	imes 6 = 24$.

If all the possible $3$-digit numbers are formed using the digits $1, 3, 5, 7, 9$ without repeating any digit,then the number of such $3$-digit numbers which are divisible by $3$ is

Similar Questions

$S_1, S_2, \ldots, S_{10}$ are the speakers in a conference. If $S_1$ addresses only after $S_2$,then the number of ways the speakers address is

Words of length $10$ are formed using the letters $A, B, C, D, E, F, G, H, I, J$. Let $x$ be the number of such words where no letter is repeated,and let $y$ be the number of such words where exactly one letter is repeated twice and no other letter is repeated. Then,$\frac{y}{9x} =$

All the letters of the word $LETTER$ are arranged in all possible ways and the words (with or without meaning) thus formed are arranged in dictionary order. Then the rank of the word $TETLER$ is

The number of different permutations that can be formed by taking $4$ letters at a time from the letters of the word '$REPETITION$' is

The total number of permutations of $n (> 1)$ different things taken not more than $r$ at a time,when each thing may be repeated any number of times is

Vedclass Test Series

Exam Paper Generator

Online Exam Module