User:Weirdguyz/Magic square of squares

The magic square of squares is an unsolved problem in mathematics which asks whether it is possible to construct a third-order magic square, the elements of which are all square numbers. The problem is a popular choice for recreational mathematicians, and multiple prizes have been offered for the first solution.

Background

Main article: Magic square

The smallest (and unique up to rotation and reflection) non-trivial case of a magic square, order 3

A magic square is a square array of integer numbers in which each row, column and diagonal sums to the same number. The order of the square refers to the number of integers along each side. A trivial magic square is a magic square which has at least one repeated element, and a semimagic square is a magic square in which the rows and columns, but not both diagonals sum to the same number.

Problem

The problem asks whether it is possible to construct a third-order magic square such that every element is itself a square number. A square which solves the problem would thus be of the form

$x_{1}^{2}$	$x_{2}^{2}$	$x_{3}^{2}$
$x_{4}^{2}$	$x_{5}^{2}$	$x_{6}^{2}$
$x_{7}^{2}$	$x_{8}^{2}$	$x_{9}^{2}$

and satisfy the following equations

${\begin{aligned}x_{1}^{2}+x_{2}^{2}+x_{3}^{2}&=x_{4}^{2}+x_{5}^{2}+x_{6}^{2}\\&=x_{7}^{2}+x_{8}^{2}+x_{9}^{2}\\&=x_{1}^{2}+x_{5}^{2}+x_{9}^{2}\\&=x_{3}^{2}+x_{5}^{2}+x_{7}^{2}\\&=x_{1}^{2}+x_{4}^{2}+x_{7}^{2}\\&=x_{2}^{2}+x_{5}^{2}+x_{8}^{2}\end{aligned}}$

Current research

It has been shown that the problem is equivalent to several other problems.

1. Do there exist three arithmetic progressions such that each has three terms, each has the same difference between terms as the other two, the terms are all perfect squares, and the middle terms of the three arithmetic progressions themselves form an arithmetic progression?
2. Do there exist three rational right triangles with the same area, such that the squares of the hypotenuses are in arithmetic progression?
3. Does there exist an elliptic curve, $y^{2}=x^{3}-n^{2}x$, where $n$ is a congruent number, with three rational points on the curve, $(x_{1},y_{1})$, $(x_{2},y_{2})$, $(x_{3},y_{3})$, such that each point is "double" another rational point on the curve ("double" in the sense of the group structure for points on an elliptic curve), and $x_{1}$, $x_{2}$ and $x_{3}$ are in arithmetic progression?

Brute force searches for solutions have been unsuccessful, and suggest that if a solution exists, it would consist of numbers greater than at least $10^{14}$.

Rice University professor of mathematics Anthony Várilly-Alvarado has expressed his doubt as to the existence of the magic square of squares.

Notable attempts

There have been a number of attempts to construct a magic square of squares by recreational mathematicians.

Gardner square

The Gardner square, named after recreational mathematician Martin Gardner, similar to the Parker square, is given as a problem to determine a, b, c and d.

1272	462	582
22	b2	c2
a2	822	d2

This solution for a = 74, b = 113, c = 94 and d = 97 gives a semimagic square; the diagonal 127² + b² + d² sums to 38307, not 21609 as for all the other rows and columns, and the other diagonal.

	1272	462	582	21609
	22	1132	942	21609
	742	822	972	21609
21609	21609	21609	21609	38307

Parker square

The Parker square, is an attempt by Matt Parker to solve the problem. His solution is a trivial, semimagic square of squares, as $29^{2}$ and $1^{2}$ both appear twice, and the diagonal $23^{2}+37^{2}+47^{2}$ sums to 4107, instead of 3051.

The Parker Square, with sums shown in bold.

	292	12	472	3051
	412	372	12	3051
	232	412	292	3051
4107	3051	3051	3051	3051

Non third-order magic squares of squares

Magic squares of squares of orders greater than 3 have been known since as early as 1770, when Leonard Euler sent a letter to Joseph-Louis Lagrange detailing a fourth-order magic square.

Euler's magic square of squares

682	292	412	372
172	312	792	322
592	282	232	612
112	772	82	492

Multimagic squares are magic squares which remain magic after raising every element to some power. In 1890, Georges Pfeffermann published a solution to a problem he posed involving the construction of an eighth-order 2-multimagic square.

Pfeffermann's eighth order 2-multimagic square

	56	34	8	57	18	47	9	31	260
	33	20	54	48	7	29	59	10	260
	26	43	13	23	64	38	4	49	260
	19	5	35	30	53	12	46	60	260
	15	25	63	2	41	24	50	40	260
	6	55	17	11	36	58	32	45	260
	61	16	42	52	27	1	39	22	260
	44	62	28	37	14	51	21	3	260
260	260	260	260	260	260	260	260	260	260