A five-digit number divisible by 3 has to be | vedclass

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

Question

(A) number is divisible by $3$ if the sum of its digits is divisible by $3$. The sum of all given digits is $0+1+2+3+4+5 = 15$. Since we need to form

Vedclass · Accepted Answer

$216$

Vedclass · Answer

(A) number is divisible by $3$ if the sum of its digits is divisible by $3$. The sum of all given digits is $0+1+2+3+4+5 = 15$. Since we need to form a $5$-digit number,we must exclude one digit such that the sum of the remaining $5$ digits is divisible by $3$.Case $1$: Exclude $0$. The remaining digits are ${1, 2, 3, 4, 5}$. The sum is $15$,which is divisible by $3$. The number of ways to arrange these $5$ digits is $5! = 120$.Case $2$: Exclude $3$. The remaining digits are ${0, 1, 2, 4, 5}$. The sum is $12$,which is divisible by $3$. The number of $5$-digit numbers that can be formed is $5! - 4! = 120 - 24 = 96$ (subtracting cases where $0$ is in the first position).Total ways = $120 + 96 = 216$.

$A$ five-digit number divisible by $3$ has to be formed using the numerals $0, 1, 2, 3, 4,$ and $5$ without repetition. The total number of ways in which this can be done is

Similar Questions

If ${ }^{2 n} C_{r} = { }^{2 n} C_{r+2}$,find $r$.

To fill $12$ vacancies,there are $25$ candidates,of which $5$ are from the scheduled caste. If $3$ of the vacancies are reserved for scheduled caste candidates while the rest are open to all,then the number of ways in which the selection can be made is:

The number of ways in which first,second and third prizes can be given to $5$ competitors is

The value of ${2^n} \{ 1 \cdot 3 \cdot 5 \cdots (2n - 3) \cdot (2n - 1) \}$ is

Out of $10$ white,$9$ black and $7$ red balls,the number of ways in which selection of one or more balls can be made,is

Vedclass Test Series

Exam Paper Generator

Online Exam Module