• Information and Communications Magazine
• /
• v.30 no.10
• /
• pp.101-108
• /
• 2013

본고에서는 2013년 대한민국 과학기술 명예의 전당에 조선시대 수학자 최석정(崔錫鼎 1646~1715) 선현이 헌정된 것을 기념하여 그의 저서 구수략(九數略)에 기록된 '직교라틴방진'이 조합수학(Combinatorial Mathematics)의 효시로 일컫는 오일러(Leonhard Euler, 1707~1783)의 '직교라틴방진' 보다 최소 61년 앞섰다는 사실이 국제적으로 인정받게 된 경위를 소개하고 최석정의 9차 직교라틴방진의 특성을 살펴본다.

• Journal for History of Mathematics
• /
• v.23 no.3
• /
• pp.21-31
• /
• 2010

A latin square of order n is an $n{\times}n$ array with entries from a set of n numbers arrange in such a way that each number occurs exactly once in each row and exactly once in each column. Two latin squares of the same order are orthogonal latin square if the two latin squares are superimposed, then the $n^2$ cells contain each pair consisting of a number from the first square and a number from the second. In Europe, Orthogonal Latin squares are the mathematical concepts attributed to Euler. However, an Euler square of order nine was already in existence prior to Euler in Korea. It appeared in the monograph Koo-Soo-Ryak written by Choi Seok-Jeong(1646-1715). He construct a magic square by using two orthogonal latin squares for the first time in the world. In this paper, we explain Choi' s orthogonal latin squares and the history of the Orthogonal Latin squares.

• Journal of Industrial Convergence
• /
• v.19 no.4
• /
• pp.23-28
• /
• 2021

This paper finds the regular pattern of n = [3, ∞] for Euler square game related with n = 6(6×6=36) thirty-six officer problem that is still unsolved problem. The solution of this problem is exists for n = [3, 10] without n = 6. Also, previous researchers finds the random assigned solution for specific number using computer programming. Therefore, the solution of n = [11, ∞] Euler squares are unsolved problem because of anything but easy. This paper attempts to find generalized patterns for domains that have been extended to n = [3, ∞], while existing studies have been limited to n = [3, 10]. This paper classify the n = [3, ∞] into n = odd, 4k even, 4k+2 even of three classes. Then we find the simple regular pattern solution for n = odd and 4k even(n/2 = even). But we can't find the regular pattern for 4k+2 even(n/2 = odd).