>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
| (6) |
>
|
|
| (7) |
If the vertices of a hexagon are colored with three different colors, then the number of distinct colored hexagons can be calculated by evaluating the cycle index polynomial of the dihedral group of degree (the group of symmetries of a hexagon) with each indeterminate equal to .
>
|
|
| (8) |
>
|
|
As a shortcut, you can use the following calling sequence.
>
|
|