Hexagonal tortoise problem
The hexagonal tortoise problem (Template:Lang-ko, Chinese: 地數龜文圖, a.k.a. jisuguimundo, jisugwimundo) was invented by Korean aristocrat and mathematician Seok-jeong Choi, who lived from 1646 to 1715. It is a mathematical problem that involves a hexagonal lattice, like the hexagonal pattern on some tortoises' shells, to the (N) vertices of which must be assigned integers (from 1 to N) in such a way that the sum of all integers at the vertices of each hexagon is the same.[1] The problem has apparent similarities to a magic square although it is a vertex-magic format rather than an edge-magic form or the more typical rows-of-cells form.[1]
References
What supports what
- ^ a b Choe, Choi & Moon 2003, p. 850. Cite error: The named reference "FOOTNOTEChoeChoiMoon2003850" was defined multiple times with different content (see the help page).
Sources used
- Choe, Heemahn; Choi, Sung-Soon; Moon, Byung-Ro (2003). Cantù-Paz, Erick (ed.). A Hybrid Genetic Algorithm for the Hexagonal Tortoise Problem. Proceedings of the Genetic and Evolutionary Computation (GECCO) Conference, Chicago, IL, USA, July 12–16, 2003. Springer. ISBN 978-3-540-40602-0.
{{cite conference}}: Invalid|ref=harv(help)
 | This number theory-related article is a stub. You can help Wikipedia by expanding it. |