KöMaL 2011 K288
We want to make a set of triangular dominoes. The stones are regular triangles with an integer from 0 to 5 in each vertex. If a stone has three different numbers on it, then they increase in clockwise order. How many domino stones will there be? (There may also be three identical numbers on a stone, or two identical and one different number.)
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.