Английская Википедия:Hexagonal tortoise problem

Материал из Онлайн справочника
Версия от 07:02, 21 марта 2024; EducationBot (обсуждение | вклад) (Новая страница: «{{Английская Википедия/Панель перехода}} {{Short description|Mathematical problem}} thumb|upright=1.4|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''' ({{...»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)
Перейти к навигацииПерейти к поиску

Шаблон:Short description

Файл: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) 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.Шаблон:Sfn 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.Шаблон:Sfn

His book, Gusuryak, contains many mathematical discoveries.

References

Шаблон:Reflist

Sources used

Шаблон:Refbegin

Шаблон:Refend


Шаблон:Numtheory-stub