edited by
521 views

2 Answers

Best answer
10 votes
10 votes
We need to find the count of 6 digit numbers that are divisible by 4, with a constraint that no digit repeats.

Divisibility rule of 4 says that, for a number $x$ to be divisible by 4, last two digits of $x$ should be divisible by 4.

All the numbers having last two digits in $\{00, 04, 08, …, 92, 96\}$ would be divisible by 4. But our constraint is that none of the digits should repeat.

Desired set would become $D = \{00, 04, 08, …, 92, 96\}  \ – \ \{00, 44, 88\} = \{04, 08, 12, …, 84, 92, 96\}$

$|D| = 22$

Lets’ partition $D$ into $D_{0}$ and $D_{\sim 0}$, where $D_{0}$ is the partition consisting of pair of digits having $0$ and $D_{\sim 0}$ partition not having zero in the pair.

$|D_0| = |\{04, 08, 20, 40, 60, 80\}| = 6$ ,  $|D_{\sim 0}| = |\{12, 16, 24, …, 84, 92, 96\}|=22-6=16$

In $D_0$,  $X0$ and $0X$ format of numbers are not in equal ratio, hence we cant’ form one case for them, we need to break them down to $D_{X0} = \{20,40,60,80\}$ and $D_{0X} = \{04, 08\}$.

Similarly, we cant’ form $D_{\sim 0}$ as one case, this is because, when we take last digit in $\{2,6\}$ then second last digit has 5 possibilities $\{1,3,5,7,9\}$. Lets’ call this set $D_{OE}$.

On the Other hand, if we take last digit as $\{4,8\}$ then second last digit has $\{2,4,6,8\}$ possibilities, in total $2*4-2 = 6$ possibilities. Lets’ call this set $D_{EE}$

$$\begin{align}\text{Total count} &= D_{X0} + D_{0X} + D_{EE} + D_{OE} \cr &= \quad 8 \times 7 \times 6 \times 5 \times 4 \times 1 \cr &\quad + \ \   8 \times 7 \times 6 \times 5 \times 1 \times 2  \cr &\quad + \ \  7 \times 7 \times 6 \times 5 \times 6  \cr &\quad + \ \ 7 \times 7 \times 6 \times 5 \times 5 \times 2 \cr &= \boxed{33,600} \end{align}$$
selected by
4 votes
4 votes

Let us consider the digits D1,D2,D3,D4,D5,D6. For a number to be divisible by 4 we need to have the last 2 digits divisible by 4.
We will have four cases 
Case 1 – 0 fixed at D6
since 0 is fixed at D6, D5 can have either of the 4 digits [2,4,6,8].
Therefore , number of ways = 8*7*6*5*4*1= 6720

Case 2 – 0 fixed at D5
since 0 is fixed at D5, D6 can have either of the 2 digits [4,8].
therefore, number of ways = 8*7*6*5*1*2 = 3360

Case 3 – considering even numbers at D5
if we consider either of the even numbers at D5 [ 2,4,6,8 ] we have 2 digits at D6 [4,8]. Since digits cannot be repeated we can have 3 options at D5 and 2 options at D6
therefore, number of ways = 7*7*6*5*3*2 = 8820

Case 4 – considering odd numbers at D5
if we consider either of the odd numbers at D5 [ 1,3,5,7,9 ] we have 2 digits at D6 [2,6].
therefore, number of ways = 7*7*6*5*5*2 = 14700

Therefore, total number of ways = 6720+3360+8820+14700 = 33600 

Reference – https://math.stackexchange.com/questions/298641/determine-the-number-of-six-digit-integers-no-leading-zeros-in-which-no-digit

edited by

Related questions

1.1k
views
4 answers
0 votes
rajeshposts asked Sep 17, 2023
1,091 views
How many ways are there to assign 5 different jobs to 4 different employees if every employee is assigned at least 1 job ?1024 625 240 20
169
views
1 answers
0 votes
jugnu1337 asked May 31
169 views
Suppose you need to come up with a password that uses only the letters A, B, and C and which must use each letter at least once. How many such passwords of length 8 are there? ... 3 *3*3*3*3i am getting 3^6*2 where i am wrong(what i miss)
261
views
0 answers
0 votes
admin asked Feb 16
261 views
Three distinct sets of indistinguishable twins are to be seated at a circular table that has $8$ identical chairs. Unique seating arrangements are defined by the ... $14$10$28$
195
views
1 answers
0 votes
Emankashyap asked Apr 17
195 views
How many ways to arrange ABCD such that A precedes B, and C precedes D