Hexagonal tortoise problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
File:Hexagonal tortoise problem.svg
Choi Seok-jeong's original magic hexagonal tortoise pattern. All the sums of six numbers of each hexagon are the same number, 93. The magic sum varies if the numbers 1 through 30 are rearranged. For example, the magic sum could be 77 through 109.

The hexagonal tortoise problem (Korean지수귀문도; Hanja地數龜文圖; RRjisugwimundo) was invented by Korean aristocrat and mathematician Choi Seok-jeong (1646–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]

His book, Gusuryak, contains many mathematical discoveries.

References

[edit | edit source]
  1. ^ a b Choe, Choi & Moon 2003, p. 850.

Sources used

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).