Related papers: The number of "magic" squares and hypercubes
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…
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…
It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…
A magic square of order n is an nxn square (matrix) whose entries are distinct nonnegative integers such that the sum of the numbers of any row and column is the same number, the magic constant. In this paper we introduce the concept of…
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…
A k-magic square of order n is an arrangement of the numbers from 0 to kn-1 in an n by n matrix, such that each row and each column has exactly k filled cells, each number occurs exactly once, and the sum of the entries of any row or any…
An additive-multiplicative magic square is a square grid of numbers whose rows, columns, and long diagonals all have the same sum (called the magic sum) and the same product (called the magic product). There are numerous open problems about…
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…
In this paper we give the first method for constructing n-multimagic squares (and hypercubes) for any n. We give an explicit formula in the case of squares and an effective existence proof in the higher dimensional case. Finally we prove…
Magic squares have been an enthralling topic in mathematics for centuries. They are formed by filling in all the cells of a square matrix with the numbers starting from one so that the sum of all rows, columns, and diagonals is the same.…
A magic SET square is a 3 by 3 table of SET cards such that each row, column, diagonal, and anti-diagonal is a set. We allow the following transformations of the square: shuffling features, shuffling values within the features, rotations…
An associative magic square is a magic square such that the sum of any 2 cells at symmetric positions with respect to the center is constant. The total number of associative magic squares of order 7 is enormous, and thus, it is not…
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…
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and…
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.
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 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…
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…
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 a fascinating mathematical challenge that has intrigued mathematicians for centuries. Given a positive (and possibly large) integer \( n \), one of the main challenges that still remains is to find, within a computational…