Related papers: Multimagic Squares
A proof that there is no $3 \times 3$ magic square constructed with nine distinct square numbers is given.
In this paper, we present the problem of counting magic squares and we focus on the case of multiplicative magic squares of order 4. We give the exact number of normal multiplicative magic squares of order 4 with an original and complete…
We review a known method of compounding two magic square matrices of order m and n with the all-ones matrix to form two magic square matrices of order mn. We show that these compounded matrices commute. Simple formulas are derived for their…
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…
We find by applying MacMahon's partition analysis that all magic squares of order three, up to rotations and reflections, are of two types, each generated by three basis elements. A combinatorial proof of this fact is given.
A magic series is a set of natural numbers that, by virtue of its size, sum, and maximum value, could fill a row of a normal magic square. In this paper, we derive an exact two-dimensional integral representation for the number of magic…
A \emph{magic square} is an $n \times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an…
Explicit algorithms are developed for constructing odd order n pandiagonal latin cubes in 3 and 4 dimensions, and these are used to construct pandiagonal magic cubes and 4 dimensional hypercubes, respectively. It is established that these…
Let $(\Gamma,+)$ be an Abelian group of order $n^2$ and MS$_{\Gamma}(n)$ be an $n\times n$ array whose entries are all elements of $\Gamma$. Then MS$_{\Gamma}(n)$ is a $\Gamma$-magic square if all row, column, main and backward main…
Magic squares are arrangements of natural numbers into square arrays, where the sum of each row, each column, and both diagonals is the same. In this paper, the concept of a magic square with 3 rows and 3 columns is generalized to define…
We find the numbers of $3 \times 3$ magic, semimagic, and magilatin squares, as functions either of the magic sum or of an upper bound on the entries in the square. Our results on magic and semimagic squares differ from previous ones in…
We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.
We describe a generalization of most-perfect magic squares, called type-p most-perfect squares, and in prime-power orders we give a linear construction of these squares reminiscent of de la Loubere's classical magic square construction…
In this paper, we define an $n$-magic square in a group to be an $(n\times n)$ array of group elements whose rows, columns, and diagonals have the same product. This definition is akin to the idea of magic squares in the integers. Groups…
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 describe in details the nxnxn Rubik's Cube, namely a Rubik's Cube with n rotating slices in each face. Then we state and prove the "first law of Cubology", i.e. the solvability criterion, for it
The main result in this paper is the proof of the recently conjectured non-existence of cubic Legendre multiplier sequences. We also give an alternative proof of the non-existence of linear Legendre multiplier sequences, using a method that…
In recreational mathematics, a normal magic square is an $n \times n$ square matrix whose entries are distinctly the integers $1 \ldots n^2$, such that each row, column, and major and minor traces sum to one constant $\mu$. It has been…
Several specific Franklin squares and magic squares are decomposed into their quotient and remainder squares. The results support the conjecture that Franklin used the Eulerian composition method to construct many of his squares. This…