Cube this problem, and in 1837 Pierre Wantzel proved it to be impossible because the cube root of 2 is not a constructible number. The cube has three uniform colorings, named by the colors of the square faces around each vertex: 111, 112, 123. The cube has three classes of symmetry, which can be represented by vertex-transitive coloring the faces. The highest octahedral symmetry O has all the faces the same color. The dihedral symmetry D comes from the cube being a prism, with all four sides being the same color. The lowest symmetry D is also a prismatic symmetry, with
Magic cube classes was first constructed in late 2004 by Mitsutoshi Nakamura. This cube is a combination Pantriagonal magic cube and Diagonal magic cube. Therefore, all main and broken triagonals sum correctly, and it contains 3"m" planar simple magic squares. In addition, all 6 oblique squares are pandiagonal magic squares. The only such cube constructed so far is order 8. It is not known what other orders are possible. See Pantriagdiag magic cube. Minimum correct summations required = 7"m" + 6"m" ALL 3"m" planar arrays must be pandiagonal magic squares. The 6 oblique squares are always magic (usually simple magic). Several of them