Four-digit numbers are formed using the digit | vedclass

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

Question

(C) Let the four-digit number be $N = d_1 d_2 d_3 d_4$.For a number to be divisible by $11$,the difference between the sum of digits at odd places and

Vedclass · Accepted Answer

$44$

Vedclass · Answer

(C) Let the four-digit number be $N = d_1 d_2 d_3 d_4$.For a number to be divisible by $11$,the difference between the sum of digits at odd places and the sum of digits at even places must be a multiple of $11$.That is,$(d_1 + d_3) - (d_2 + d_4) = 11k$,where $k \in \{0, 1, -1\}$.Since each digit $d_i \in \{1, 2, 3, 4\}$,the minimum sum of two digits is $1+1=2$ and the maximum sum is $4+4=8$.Thus,the difference $(d_1 + d_3) - (d_2 + d_4)$ can range from $2-8 = -6$ to $8-2 = 6$.The only multiple of $11$ in this range is $0$.Therefore,$(d_1 + d_3) = (d_2 + d_4)$.Let $S = d_1 + d_3 = d_2 + d_4$. Possible values for $S$ are:If $S=2$: $(1,1) \Rightarrow 1$ way.If $S=3$: $(1,2), (2,1) \Rightarrow 2$ ways.If $S=4$: $(1,3), (2,2), (3,1) \Rightarrow 3$ ways.If $S=5$: $(1,4), (2,3), (3,2), (4,1) \Rightarrow 4$ ways.If $S=6$: $(2,4), (3,3), (4,2) \Rightarrow 3$ ways.If $S=7$: $(3,4), (4,3) \Rightarrow 2$ ways.If $S=8$: $(4,4) \Rightarrow 1$ way.The number of ways to choose $(d_1, d_3)$ is the same as the number of ways to choose $(d_2, d_4)$.Total numbers $= 1^2 + 2^2 + 3^2 + 4^2 + 3^2 + 2^2 + 1^2 = 1 + 4 + 9 + 16 + 9 + 4 + 1 = 44$.

Four-digit numbers are formed using the digits $1, 2, 3, 4$ (repetition is allowed). The number of such four-digit numbers divisible by $11$ is

Similar Questions

In how many ways can the letters of the word '$MATHEMATICS$' be arranged,when all vowels come together?

In a touring cricket team,there are $16$ players in all,including $5$ bowlers and $2$ wicket-keepers. How many teams of $11$ players can be chosen from these,such that each team includes exactly $3$ bowlers and $1$ wicket-keeper?

$A = \{ x_1, x_2, x_3, x_4 \}; \, B = \{ y_1, y_2, y_3, y_4 \}.$ $A$ function is defined from set $A$ to set $B.$ The number of one-one functions such that $f(x_i) \neq y_i$ for $i = 1, 2, 3, 4$ is equal to:

How many odd numbers less than $1000$ can be formed using the digits $0, 2, 5, 7$? (repetition of digits is allowed).

How many $3$-digit odd numbers can be formed from the digits $1, 2, 3, 4, 5, 6$ when
$(i)$ repetition of digits is not allowed
(ii) repetition of digits is allowed?

Vedclass Test Series

Exam Paper Generator

Online Exam Module