魔方的顺序是4k+2

Serafeim A. Triantafyllou
{"title":"魔方的顺序是4k+2","authors":"Serafeim A. Triantafyllou","doi":"10.1109/TELECOM56127.2022.10017312","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":359231,"journal":{"name":"2022 30th National Conference with International Participation (TELECOM)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Magic Squares in Order 4k+2\",\"authors\":\"Serafeim A. Triantafyllou\",\"doi\":\"10.1109/TELECOM56127.2022.10017312\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":359231,\"journal\":{\"name\":\"2022 30th National Conference with International Participation (TELECOM)\",\"volume\":\"156 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 30th National Conference with International Participation (TELECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TELECOM56127.2022.10017312\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 30th National Conference with International Participation (TELECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TELECOM56127.2022.10017312","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文主要研究的是4k+2阶的幻方。神奇的正方形是一个被分成n × n个小正方形的正方形,这些小正方形的一边上面写着等差数列。这个序列由从1到$n^{2}$的数字组成,这样行、列和对角线的总和是相同的。本研究旨在通过实现和提出一种识别和生成4k+2阶魔方的算法方法,更好地理解4k+2阶魔方,以便于未来的研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Magic Squares in Order 4k+2
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信