Icosian Game

The problem of finding a Hamiltonian Circuit along the edges of an Icosahedron, i.e., a path such that every vertexis visited a single time, no edge is visited twice, and the ending point is the same as the starting point.

References

Herschel, A. S. ``Sir Wm. Hamilton's Icosian Game.'' Quart. J. Pure Applied Math. 5, 305, 1862.

• Subtraction
• Succeeds
• Successes
• Sufficient
• Suitable Number
• Sum
• Summand
• Summatory Function
• Sum-Product Number
• Sum Rule
• Sup
• Characteristic (Partial Differential Equation)
• Characteristic Polynomial
• Characteristic (Real Number)
• Character (Multiplicative)
• Character (Number Theory)
• Character Table
• Charlier's Check
• Chasles-Cayley-Brill Formula
• Chasles's Contact Theorem
• Chasles's Polars Theorem
• Chasles's Theorem
• Chebyshev Approximation Formula
• Chebyshev Constants
• Chebyshev Deviation