No panmagic squares of order three when the line sum is not divisible by three
ProvedMagicSquares.pan_three_otherwiseThe zero case for panmagic squares.
Writing for the number of panmagic squares of order and line sum , the theorem is
It complements the evaluation : together they give the complete count for and otherwise.
Proof. A panmagic square is in particular a magic square, because the broken
diagonals of offset are exactly the two main diagonals. For a magic square of
order three and line sum , the classical centre identity
center_of_order_three gives where is the centre entry. Hence
, and the square cannot exist when is not divisible by three.
Context. This is the standard divisibility obstruction for order-three magic
squares: the centre is forced to be one third of the line sum, so line sums
indivisible by three are impossible for any class that contains the magic
squares. The same argument already gave the vanishing of the plain magic count
magic_count_three_otherwise and of the semi-magic count; what the present
statement adds is only the observation that panmagicity is stronger than
magicity, so the obstruction is inherited.
import Mathlib import Definitions.Def_MagicSquares open MagicSquares
namespace MagicSquares theorem pan_three_otherwise (t : ℕ) (ht : ¬ 3 ∣ t) : panMagicCount 3 t = 0 := by sorry end MagicSquares
Confirmed by the mission captain (proposal self-audit).