The \triangle prefers to live in colors!

The triangle shown below consists of four small triangles of equal area. If each of the four small triangles are to be filled with one of the four colors (red, green, blue and yellow), such that no two adjacent triangles can have the same color, then find the number of possible combinations.

Details and Assumption:

  • Each of the four small triangles are to be considered distinct.
  • Adjacent triangles are those which have a common edge.


The answer is 108.

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

Stephen Mellor
Jun 7, 2018

First, assign a colour to the middle triangle (which can be done in 4 ways).

Then, for each of the 3 triangles in the corners, they can be any one of the 3 remaining colours (independently of each other).

Therefore, there are 4 × 3 × 3 × 3 = 108 4 \times 3 \times 3 \times 3 = \boxed{108} ways.

( @Shreyansh Mukhopadhyay also please remove the word "primary" from the question as there are 3 primary colours, not 4)

Stephen Mellor - 3 years ago

Log in to reply

Yeah, sure

Nice approach. +1! I wonder what if the problem allows rotation of the triangle on the plane, and asks number of distinct coloring.

Mayank Chaturvedi - 2 years, 11 months ago
Chew-Seong Cheong
Jul 10, 2018

We note that the outer three triangles can be filled with any of the four colors. Therefore, there are 4 3 = 64 4^3=64 ways of filling them. If the outer triangles are filled with n n different colors. where n = 1 , 2 , 3 n=1, 2, 3 , then the number of ways to filled the three outer triangles is N o ( n ) = N c ( n ) N p ( n ) N_o (n) = N_c (n) N_p (n) , where N c ( n ) = ( 4 n ) N_c(n) = \dbinom 4n is the number of ways to choose n n colors and N p ( n ) N_p (n) is the number of ways to permute the n n colors among the three triangles. Then, we have:

n : N c ( n ) × N p ( n ) = N o ( n ) 1 : 4 × 1 = 4 2 : 6 × 6 = 36 3 : 4 × 6 = 24 64 \begin{array} {ccccccc} n & : & N_c(n) & \times & N_p(n) & = & N_o(n) \\ \hline 1 & : & 4 & \times & 1 & = & 4 \\ 2 & : & 6 & \times & 6 & = & 36 \\ 3 & : & 4 & \times & 6 & = & 24 \\ \hline & & & & & & 64 \end{array}

The middle triangle however must be filled with a color different from that of any of the three outer triangles. Therefore, the number of ways to fill the middle triangle is N m ( n ) = 4 n N_m (n) = 4-n . And the total number of ways of filling the four triangles is given by:

n : N o ( n ) × N m ( n ) = N ( n ) 1 : 4 × 3 = 12 2 : 36 × 2 = 72 3 : 24 × 1 = 24 108 \begin{array} {ccccccc} n & : & N_o(n) & \times & N_m(n) & = & N(n) \\ \hline 1 & : & 4 & \times & 3 & = & 12 \\ 2 & : & 36 & \times & 2 & = & 72 \\ 3 & : & 24 & \times & 1 & = & 24 \\ \hline & & & & & & \boxed{108} \end{array}

Sir, I did the same like @Stephen Mellor , but I have the same question as @Mayank Chaturvedi , what will be the answer when rotations are allowed and we need distinct colorings? Thanks! BTW, nice solution!

Vinayak Srivastava - 10 months, 1 week ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...