Bordered magic squares: Elements for a comprehensive approach
نویسنده
چکیده
General methods for the construction of magic squares of any order have been searched for centuries. Several " standard strategies " have been found for this purpose, such as the " knight movement " , or the construction of bordered magic squares, which played an important role in the development of general methods. What we try to do here is to give a general and comprehensive approach to the construction of magic borders, capable of assuming methods produced in the past like particular cases. This general approach consists of a transformation of the problem of constructing magic borders to a simpler almost trivial-form. In the first section, we give some definitions and notation. The second section consists of the exposition and proof of our method for the different cases that appear (Theorems 1 and 2). As an application of this method, in the third section we caracterise magic borders of even order, giving therefore a first general result for bordered magic squares. Although methods for the construction of bordered magic squares have always been presented as individual succesful attempts to solve the problem , we will see that a common pattern underlies the fundamental mechanisms that lead to the construction of such squares. This approach provides techniques for constructing many magic bordered squares of any order, which is a first step to construct all of them,and finally know how many bordered squares are for any order. These may be the first elements of a general theory on bordered magic squares.
منابع مشابه
Numerical Enumeration of Greco-Latin Prime Order Associative Magic Squares
A magic square of order n consists of the numbers 1 to n placed such that the sum of each row, column and principal diagonal equals the magic sum n(n +1)/2. In addition, an odd ordered magic square is associative or self-complementary if diagonally opposite elements have the same sum (n +1)/2. The magic square is said to be regular Greco-Latin if it can be decomposed as a sum of a pair of Latin...
متن کاملCalculating the Number of Order-6 Magic Squares with Modular Lifting
Introduction There is no known general formula to calculate the total number of magic squares of a given order. However, using various methods, the number of magic squares has been calculated for orders smaller than 6. In this work we describe an approach to bounding the computational complexity of enumerating order-6 squares and provide a related method to approximate the number of such square...
متن کاملA Contemplation in Shari'a's View towards the Magic with an Approach to Mawlana's Thoughts
The magic is something with a subtle source, which is not seen with eye, and its source cannot be found in a normal way. The magic has a variety of forms that have harmful and non-harmful effects. The wizards use the latter one to deceive people. The motive for choosing this topic among other ones is that some people resort to the magic for different reasons such as: outbreaking demons for the ...
متن کاملPolyhedral Cones of Magic Cubes and Squares
Using computational algebraic geometry techniques and Hilbert bases of polyhedral cones we derive explicit formulas and generating functions for the number of magic squares and magic cubes. Magic cubes and squares are very popular combinatorial objects (see [2, 15, 17] and their references). A magic square is a square matrix whose entries are nonnegative integers and whose row sums, column sums...
متن کاملCreating Semi-Magic, Magic and Extra Magic n× n Squares when n is Odd
We define a simple algorithm for creating large numbers of semi-magic n× n squares when n is odd. Special cases of the algorithm can also be used to easily create magic and extra magic (or panmagic) n× n squares when n is odd. The algorithm can also create extremely magic n × n squares when n ≥ 5 is prime. These extremely magic n × n squares have n! standard magic n-element subsets, and these n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 100 شماره
صفحات -
تاریخ انتشار 2011