• Journal for History of Mathematics
• /
• v.30 no.2
• /
• pp.71-86
• /
• 2017

When looking for solutions of Jisuguimundo with magic number 88~92 and 94~98, alternating method is applied to each possible partitions of each magic number. But this method does not apply in case of finding solutions of Jisuguimundo with magic number 87, 93, and 99. In this study, it is shown that solutions of Jisuguimundo with magic number 87, 93, and 99 can be found by applying alternating method to two partitions. These two partitions are derived partitions obtained by each partitions of magic number 87, 93, and 99. If every number from 1 to 30 which satisfy every unit path of Jisuguimundo can be found in all components of these two derived partitions, that arrangement is just a solution of Jisuguimundo. The method suggested in this study is more developed one than the method which is applied to just one partition.

• Journal for History of Mathematics
• /
• v.31 no.4
• /
• pp.183-196
• /
• 2018

In this study, we propose an approximate method to make Jisuguimundo with magic number 93 to 109. In this method, for two numbers p, q with a relationship of M = 2p+q, we use eight pairs of two numbers with sum p and five pairs of two numbers with sum q. Such numbers must be between 1 and 30. Instead of determining all positions of thirty numbers, this method shows that Jisuguimundo with magic number 93 to 109 can be made by determining positions of thirteen numbers $a_i$(i = 1, 2, ${\cdots}$, 8), $b_5$, $c_i$(i = 1, 2, 3, 4). Method 1 is used to make Jisuguimundo with magic number 93 to 108, and method 2 is used to make Jisuguimundo with magic number 109.

• Journal for History of Mathematics
• /
• v.27 no.2
• /
• pp.111-125
• /
• 2014

Jisuguimundo is an inimitable magic hexagon devised by Choi Seok-Jeong, who was the author of GuSuRyak as well as a prime minister in Joseon dynasty. Jisuguimundo, recorded in GuSuRyak, is also known as Hexagonal Tortoise Problem (HTP) because its nine hexagons resemble a tortoise shell. We call the sum of numbers in a hexagon in Jisuguimundo a magic sum, and show that the magic sum of hexagonal tortoise problem of order 2 varies 40 through 62 exactly and that of hexagonal tortoise problem of order 3 varies 77 through 109 exactly. We also find all of the possible solutions for hexagonal tortoise problem of oder 2.

• Journal of Elementary Mathematics Education in Korea
• /
• v.15 no.1
• /
• pp.77-93
• /
• 2011

Jisuguimundo(地數龜文圖) is a magic hexagon created by Suk-Jung Choi in his book about three hundreds years ago in Korea. Recently attention is focused on jisuguimundo, and it is known that jisuguimundos exist when magic number is from 77 to 108, however a general method making jisuguimundos is not known so far. Up to now, methods of making jisuguimundos using computers are known. In this study, a method making jisuguimundos is suggested using pairs of two numbers with sum p and q ($p{\neq}q$) alternately when magic number is from 88 to 92, and from 94 to 98, without using computer in elementary math class as a task for problem solving. Mathematical theory is introduced for this method, and jisuguimundos are presented which are found out through this method. Elementary students are expected to make their own jisuguimundo using this method.

• Journal of the Korean School Mathematics Society
• /
• v.14 no.3
• /
• pp.261-275
• /
• 2011

Seok-Jung Choi's Jisuguimundo mentioned as a brilliant legacy in the history of Korean mathematics had been cloaked in mystery for 300 years. In the meantime there has been some efforts to find solutions, and some particular answers were found, but no one achieved full success mathematically. By the way, H-alternating method showed that to find solutions of Jisuguimundo is possible, even though that method restricted magic number to 88~92 and 94~98. In this paper, $n{\times}n$ Jisuguimundo is defined, and it is showed that finding solutions of it is always possible in case of partition $({\upsilon}+1)+{\upsilon}+({\upsilon}+1)$ & co-partition ${\upsilon}+({\upsilon}+1)+{\upsilon}$, partition $({\upsilon}+1)+({\upsilon}-1)+({\upsilon}+1)$ & co-partition $({\upsilon}-1)+({\upsilon}+1)+({\upsilon}-1)$, partition $({\upsilon}+1)+({\upsilon}+2)+({\upsilon}+1)$ & co-partition $({\upsilon}+2)+({\upsilon}+1)+({\upsilon}+2)$, and partition $({\upsilon}+1)+({\upsilon}+3)+({\upsilon}+1)$ & co-partition $({\upsilon}+3)+({\upsilon}+1)+({\upsilon}+3)$. And It is suggested to find solutions of $n{\times}n$ Jisuguimundo could be used as a task for problem solving.