Such colours

21 , 31 , 41 , 51 , 61 , 71 , 81 \color{#D61F06}{21}, \color{#3D99F6}{31},\color{#20A900}{41},\color{#69047E}{51},\color{grey}{61},\color{#EC7300}{71}, \color{#302B94}{81}

In how many ways can one arrange the numbers above such that the sum of every four consecutive numbers is divisible by 3 \color{#624F41}{3} ?


The answer is 144.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Tijmen Veltman
Apr 9, 2015

We categorise the numbers mod 3:

21 , 51 , 81 0 ( mod 3 ) 31 , 61 1 ( mod 3 ) 41 , 71 2 ( mod 3 ) \begin{aligned} 21,51,81 &\equiv 0 (\text{mod} 3) \\ 31,61 &\equiv 1 (\text{mod} 3) \\ 41,71 &\equiv 2 (\text{mod} 3) \end{aligned}

Call an arrangement of the seven numbers a 1 , a 2 , , a 7 a_1,a_2,\ldots,a_7 . We have:

a 1 + a 2 + a 3 + a 4 0 ( mod 3 ) a 2 + a 3 + a 4 + a 5 0 ( mod 3 ) \begin{aligned} a_1+a_2+a_3+a_4& &\equiv 0 (\text{mod} 3) \\ a_2+a_3+a_4& +a_5 &\equiv 0 (\text{mod} 3) \end{aligned}

hence a 1 a 5 ( mod 3 ) a_1\equiv a_5 (\text{mod} 3) . Likewise, a 2 a 6 ( mod 3 ) a_2\equiv a_6 (\text{mod} 3) and a 3 a 7 ( mod 3 ) a_3\equiv a_7 (\text{mod} 3) . Thus a 4 a_4 , the one remaining number, must be in the class 0 ( mod 3 ) 0 (\text{mod} 3) .

The numbers a 1 , a 2 , a 3 a_1,a_2,a_3 must each be put in a different residue class, which we can pick in 3 ! 3! ways. Each residue class can then be arranged at will, giving 3 ! × 2 ! × 2 ! 3!\times 2!\times 2! possibilities. Hence in total we have 3 ! 3 ! 2 ! 2 ! = 144 3!3!2!2!=\boxed{144} arrangements.

0.31.41.0.0.61.71.0 ... there are 8 ways for this form We have 3 choice for the second 0, 2 choice for the third 0, And the final number have 2 place at first 0 anh forth 0. So we have 8x3x2x2 = 96 arrangements

vu van luan - 6 years, 2 months ago

I couldn't understand why 24 was multiplied by 3! in the end. Please Explain.

Grijesh Agrawal - 6 years, 2 months ago

Log in to reply

Because a 1 , a 2 , a 3 a_1,a_2,a_3 can be permuted in 3 ! 3! ways.

Nihar Mahajan - 6 years, 2 months ago
Irina Stanciu
Nov 19, 2016

These numbers leave when divided by 3. We have 3 0s (21, 51, 81), 2 1s (31, 61), and 2 -1s (41, 71).

Any combination of the following form will do: 1 -1 0 0 1 -1 0 or -1 1 0 0 -1 1 0 or 0 1 -1 0 0 1 -1 or 0 -1 1 0 0 -1 1

As we can observe it is needed a cycle of 1 -1 0 0 or -1 1 0 0.

For each of the 4 possibilities listed, the permutations are 3! * 2! * 2!=6 * 2 * 2=24 (3! for the 3 0s, and 2! for both 1s and -1s)

There are two more possibilities: 1 0 -1 0 1 0 -1 and -1 0 1 0 -1 0 1

Finally, the total number of ways is 6 * 24 = 144

Lu Chee Ket
Nov 1, 2015

Scientific I would tell.

From 21, 31, 41, 51, 81, 61, 71 of 144, 204, 234, 264 coded 1234756

To 81, 71, 61, 51, 21, 41, 31 of 264, 204, 174, 144 coded 7654132,

There are a total of 144 out of 5040 which satisfied.

Answer: 144

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...