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 Perfect magic cube. Nasik; A. H. Frost (1866) referred to all but the simple magic cube as Nasik!<br> C. Planck (1905) redefined "Nasik" to mean magic hypercubes of any order or dimension in which all possible lines summed correctly.<br> i.e. Nasik is a preferred alternate, and less ambiguous term for the "perfect" class.<br>Minimum correct summations required = 13"m". All pan-"r"-agonals sum correctly for "r" = 1, 2 and 3. Alternate Perfect Note that the above is a relatively new definition of "perfect". Until about 1995 there was much confusion about what constituted a "perfect" magic cube (see the discussion under