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

$A$ number lock consists of three rings. If the $1^{st}$ ring is marked with digits $0$ to $9$,the $2^{nd}$ ring is marked with prime numbers greater than $2$ but less than $30$,and the $3^{rd}$ ring is marked with all vowels,find the total number of unsuccessful attempts.

If $x, y$ and $r$ are positive integers, then $^x{C_r} + ^x{C_{r-1}} \cdot ^y{C_1} + ^x{C_{r-2}} \cdot ^y{C_2} + \dots + ^y{C_r} = $

The sides $AB, BC, CA$ of a triangle $ABC$ have respectively $3, 4$ and $5$ points lying on them. The number of triangles that can be constructed using these points as vertices is

The total number of $4$-digit numbers which can be formed using the digits $1, 2, 3, 4$ without repetition such that the digit $n+1$ never immediately follows the digit $n$ (for $n=1, 2, 3$) is:

How many even numbers of $3$ different digits can be formed from the digits $1, 2, 3, 4, 5, 6, 7, 8, 9$ (repetition is not allowed)?

Vedclass Test Series

Exam Paper Generator

Online Exam Module