Related papers: Magic Triangles
A curious number is a palindromic number whose base ten representation has the form $a \ldots a b \ldots b a \ldots a$. In this paper, we determine all curious numbers that are perfect squares. Our proof involves reducing the search for…
We consider the notion of a signed magic array, which is an $m \times n$ rectangular array with the same number of filled cells $s$ in each row and the same number of filled cells $t$ in each column, filled with a certain set of numbers…
A novel kind of self-referential square matrix is introduced. A certain subset of the matrix entries record the frequencies of occurrence of each distinct number appearing within the entire matrix. Such squares are necessarily elusive. Our…
The aim of this note is to introduce a fast new general method for the construction of double and single even order magic squares. The method for double even order magic squares is fairly straight-forward but some adjustment is necessary…
In this paper we have produced different kinds of bimagic squares based on bimagic squares of order 8x8, 16x16, 25x25, 49x49, etc. A different technique is applied to produce bimagic square of order 16x16, 25x25, 49x49, etc. The bimagic…
We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.
This paper aims to address the relation between a magic square of odd order $n$ and a group, and their properties. By the modulo number $n$, we construct entries for each table from initial table of magic square with large number $n^2$.…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…
We explore some of the properties of consecutive, equally-summed arithmetic progressions of odd numbers, particularly their offsets and sums, before using them to prove that no $3\times3$ magic squares of distinct square integers exist.
In this paper we consider the problem of finding pairs of triangles whose sides are perfect squares of integers, and which have a common perimeter and common area. We find two such pairs of triangles, and prove that there exist infinitely…
Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, where a marked set of integers is given by black-box access…
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.
By defining the dimension of natural numbers as the number of prime factors, all natural numbers smaller than 2^(n+1) (n is a natural number) can be classified by their dimensions, and the count of numbers of each dimension gives a…
Triangles are everywhere in the virtual world. The surface of nearly every graphical object is saved as a triangular mesh on a computer. Light effects and movements of virtual objects are computed on the basis of triangulations. Besides…
Let $(\Gamma,+)$ be an Abelian group of order $n^2$. A $\Gamma$-magic square of order $n$ is an $n\times n$ array whose entries are pairwise distinct elements of $\Gamma$ such that all row sums, column sums, and the two main diagonal sums…
We propose a simple algorithm for generating Binary Magic Squares (BMS), i.e., square binary matrices where the sum of all rows and all columns are equal. We show by induction that our algorithm always returns valid BMS with optimal…
We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite…
This is a translation of Leonhard Euler's ``De quadratis magicis'' . It is E795 in the Enestrom index. This paper studies how to construct magic squares with certain numbers of cells, in particular 9, 16, 25 and 36. It considers some…
A magic square of order $n$ with all subsquares of possible orders (ASMS$(n)$) is a magic square which contains a general magic square of each order $k\in\{3, 4, \cdots, n-2\}$. Since the conjecture on the existence of an ASMS was proposed…
Over the last decade, Sudoku, a combinatorial number-placement puzzle, has become a favorite pastimes of many all around the world. In this puzzle, the task is to complete a partially filled $9 \times 9$ square with numbers 1 through 9,…