2008
DOI: 10.1016/j.dam.2007.09.029
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for constructing magic squares

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0
1

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 8 publications
0
6
0
1
Order By: Relevance
“…In fact, it has been shown that C is an MS(mn) in [14]. It remains to check that C has the property of t-powered sum.…”
Section: Construction 21 If There Exist Both a Yms(m T) And An Ms(nmentioning
confidence: 97%
“…In fact, it has been shown that C is an MS(mn) in [14]. It remains to check that C has the property of t-powered sum.…”
Section: Construction 21 If There Exist Both a Yms(m T) And An Ms(nmentioning
confidence: 97%
“…[1][2][3] 단일 짝수 마방진은 Madjig 를 이용하는 방법 [1], Strachey [3,4] 방법과 Conway [2,3,7] 의 LUX 방법이 있다. 이외에도 Kim과 Yoo [8] 은 곱셈법을 적용하였으며, Jacob과 Murugan [9] 은 이중 짝수 마방진 을 구성하는 방법을, Chen et al [10] …”
Section: ⅰ 서 론unclassified
“…Magic Polygons are objects that had its inspiration on the classics Magics Squares, and these are known from a long time ago, and there are algorithms to build Magic Squares of different orders, as we can see in [1,2,3,4,5,6]. Furthermore, such objects has applications in fields like Computer Science Physics and Cryptography according to [7,8,9].…”
Section: Introductionmentioning
confidence: 99%