Difference between revisions of "MIE 2016/Day 1/Problem 10"
(→See Also) |
(→See Also) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 17: | Line 17: | ||
==Solution == | ==Solution == | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Latest revision as of 21:13, 10 January 2018
Problem 10
A hexagon is divided into 6 equilateral triangles. How many ways can we put the numbers from 1 to 6 in each triangle, without repetition, such that the sum of the numbers of three adjacent triangles is always a multiple of 3? Solutions obtained by rotation or reflection are differents, thus the following figures represent two distinct solutions.
(a) 
(b) 
(c) 
(d) 
(e) 
