相关论文: On magic squares

Similar to how standard Young tableaux represent paths in the Young lattice, Latin rectangles may be use to enumerate paths in the poset of semi-magic squares with entries zero or one. The symmetries associated to determinant preserve this…

Euler wants to find rational numbers (integers) x and y such that x+y is a square and x^2+y^2 is a fourth power. He parametrizes these with two other variables that satisfy certain equations.

A Latin square $L(n,k)$ is a square of order $n$ with its entries colored with $k$ colors so that all the entries in a row or column have different colors. Let $d(L(n,k))$ be the minimal number of colored entries of an $n \times n$ square…

We study 4-by-4 squares formed by cards from the EvenQuads deck. EvenQuads is a card game with 64 cards where cards have 3 attributes with 4 values in each attribute. A quad is four cards with all attributes the same, all different, or half…

The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…

A Latin square of order $n$ is an $n\times n$ array which contains $n$ distinct symbols exactly once in each row and column. We define the adjacent distance between two adjacent cells (containing integers) to be their difference modulo $n$,…

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…

E727 in the Enestrom index. This is a translation from the Latin original "Accuratior evolutio problematis de linea brevissima in superficie quacunque ducenda" (1779). Given a surface $pdx+qdy+rdz=0$, Euler wants to develop equations that…

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…

A Latin square has six conjugate Latin squares obtained by uniformly permuting its (row, column, symbol) triples. We say that a Latin square has conjugate symmetry if at least two of its six conjugates are equal. We enumerate Latin squares…

This translation has been published in Stephen Hawking (ed.), "God Created the Integers", published in 2007 by Running Press. There may have been some changes to the final published version and this copy. This is a translation from the…

To get another from a given latin square, we have to change at least 4 entries. We show how to find these entries and how to change them.

Quantum magic squares were recently introduced as a 'magical' combination of quantum measurements. In contrast to quantum measurements, they cannot be purified (i.e. dilated to a quantum permutation matrix) -- only the so-called…

In this short note we have given an equation based on the date 11.09.2001 and presented some magic squares. The magic squares presented are of order 3x3, 4x4, 5x5, 9x9, 16x16 and 25x25. While the magic square of higher order 9x9, 16x16 and…

Euler had considered the problem of finding three integers whose sum, product, and also the sum of the products of the integers, taken two at a time, are all perfect squares. Euler's methods of solving the problem lead to parametric…

This is the translation of Leonhard Euler's paper "De Seriebus divergentibus" written in Latin into English. Leonhard Euler defines and discusses divergent series. He is especially interested in the example $1!-2!+3!-\text{etc.}$ and uses…

In this paper, constructions of multimagic squares are investigated. Diagonal Latin squares and Kronecker products are used to get some constructions of multimagic squares. Consequently, some new families of compound multimagic squares are…

We construct and classify all possible Magic Squares (MS's) related to Euclidean or Lorentzian rank-3 simple Jordan algebras, both on normed division algebras and split composition algebras. Besides the known Freudenthal-Rozenfeld-Tits MS,…

We show the 3 by 3 magic square of squares problem equivalent to solving quartic polynomials with certain factorization constraints over an abelian extension of the rationals. We analyze a particular case in which said extension is assumed…

Translated from the Latin original "Facillima methodus plurimos numeros primos praemagnos inveniendi" (1778). E718 in the Enestrom index. If m is a number of the form 4k+1 and is a sum of two relatively prime squares, then it is prime if…