Total number of 3-digit numbers that are divi | vedclass

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

Question

(B) number is divisible by $6$ if it is divisible by both $2$ and $3$. Since the number must be divisible by $2$,the unit digit must be $2$ or $4$. Si

Vedclass · Accepted Answer

$16$

Vedclass · Answer

(B) number is divisible by $6$ if it is divisible by both $2$ and $3$. Since the number must be divisible by $2$,the unit digit must be $2$ or $4$. Since the number must be divisible by $3$,the sum of its digits must be a multiple of $3$. Case $1$: Unit digit is $2$. The sum of the first two digits must be $3k - 2$. Possible pairs $(d_1, d_2)$ such that $d_1 + d_2 + 2$ is a multiple of $3$: $(1, 0)$ is not possible,$(1, 3) \rightarrow 132, 312$; $(2, 2) \rightarrow 222$; $(2, 5) \rightarrow 252, 522$; $(3, 1) \rightarrow 312, 132$; $(3, 4) \rightarrow 342, 432$; $(4, 3) \rightarrow 432, 342$; $(5, 2) \rightarrow 522, 252$; $(5, 5) \rightarrow 552$. Unique numbers ending in $2$: $132, 312, 222, 252, 522, 342, 432, 552$. (Total $8$ numbers). Case $2$: Unit digit is $4$. The sum of the first two digits must be $3k - 4$. Possible pairs $(d_1, d_2)$ such that $d_1 + d_2 + 4$ is a multiple of $3$: $(1, 1) \rightarrow 114$; $(1, 4) \rightarrow 144, 414$; $(2, 3) \rightarrow 234, 324$; $(3, 2) \rightarrow 324, 234$; $(4, 1) \rightarrow 414, 144$; $(4, 4) \rightarrow 444$; $(5, 3) \rightarrow 534, 354$. Unique numbers ending in $4$: $114, 144, 414, 234, 324, 444, 534, 354$. (Total $8$ numbers). Total numbers = $8 + 8 = 16$.

Total number of $3$-digit numbers that are divisible by $6$ and can be formed by using the digits $1, 2, 3, 4, 5$ with repetition is $.......$.

Similar Questions

The number of $4$-digit integers in the closed interval $[2022, 4482]$ formed by using the digits $0, 2, 3, 4, 6, 7$ is:

Find the number of natural number solutions to the equation $x_1 + x_2 = 100$,such that $x_1$ and $x_2$ are not multiples of $5$.

An eight-digit number divisible by $9$ is to be formed using digits from $0$ to $9$ without repeating the digits. The number of ways in which this can be done is: (in $(7!)$)

If a five-digit number divisible by $3$ is to be formed using the digits $0, 1, 2, 3, 4,$ and $5$ without repetition,then the total number of ways this can be done is:

$A$ man has $7$ relatives: $4$ ladies and $3$ gentlemen. His wife also has $7$ relatives: $3$ ladies and $4$ gentlemen. In how many ways can they invite a dinner party of $3$ ladies and $3$ gentlemen,such that there are $3$ of the man's relatives and $3$ of the wife's relatives?

Vedclass Test Series

Exam Paper Generator

Online Exam Module