Magic Squares in Order 4k+2

被引:0
|
作者
Triantafyllou, Serafeim A. [1 ]
机构
[1] Greek Minist Educ & Religious Affairs, Athens, Greece
关键词
magic squares; algorithms; algorithmic approach;
D O I
10.1109/TELECOM56127.2022.10017312
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
This paper is a study that is focused on magical squares in order 4k+2. A magical square is a square that is divided in n x n smaller squares and above one side of these smaller squares is written an arithmetic sequence. This sequence consists of numbers ranging from 1 to n(2) in a way so that the sum of rows, columns and diagonals is the same. This study aims to give a better understanding of magic squares in order 4k+2 for future research, by implementing and presenting an algorithmic approach of identifying and generating magic squares in order 4k+2.
引用
收藏
页数:4
相关论文
共 50 条