Will it be proven that nxn magic squares of distinct perfect square numbers exist for all n ≥ 4 by end of 2025?
15
170Ṁ1324
resolved Feb 17
Resolved
YES

Like the famed "Parker Square", but with distinct digits. Examples exist for 4x4, 5x5, 6x6, maybe higher. 3x3 is conjectured impossible. It must be a square of distinct perfect square integers such that each row, column, and diagonal sums to the same number.

Inspired by https://www.youtube.com/watch?v=U9dtpycbFSY, where the latest Numberphile guest conjectures this is the case.

See also

General policy for my markets: In the rare event of a conflict between my resolution criteria and the agreed-upon common-sense spirit of the market, I may resolve it according to the market's spirit or N/A, probably after discussion.

Get
Ṁ1,000
to start trading!

🏅 Top traders

#NameTotal profit
1Ṁ380
2Ṁ27
3Ṁ15
4Ṁ10
5Ṁ10
Sort by:

@Conflux If I prove this and post a pdf of it in the comments, does that count? What is the standard of rigor needed here?

bought Ṁ250 YES

See this webpage from 2005. Between the explicit examples for n=4,5,6,7 there and the article he references, which claims (pg 58)

Bimagic squares of size 8x8 and above are already known

it seems like this is proven.

@BoltonBailey oh huh, I think you’re right. I’ll try to find time to look closer soon but I think this is a yes

@Conflux I feel like they said that on the latest Numberphile, right?

@Conflux I hadn't seen it until you mentioned it, but yes the video and this paper referenced in it explicitly claims it (although again, seems like this was known 20 years ago).

@BoltonBailey Yeah, this is just already proven. A little silly of me to make the market then, but seems like a yes!

@Conflux Well, not very silly, since it seem like the mathematician in that earlier numberphile video didn't realize either!

It seems likely to me that there could be some standard pattern that solves this for all n >= N for a fixed N, and then all cases less than N could be brute forced.

© Manifold Markets, Inc.Terms + Mana-only TermsPrivacyRules