Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °

You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**krassi_holmz****Real Member**- Registered: 2005-12-02
- Posts: 1,905

How can I make a program that by given n^2 integers to answer how can you make or if there doesn't exist a magic square from these integers?

*Last edited by krassi_holmz (2005-12-11 08:09:34)*

IPBLE: Increasing Performance By Lowering Expectations.

Offline

**MathsIsFun****Administrator**- Registered: 2005-01-21
- Posts: 7,626

I believe you can use an additive process - you construct the square out of several special tilings.

Ahhh ... Wikipedia has an answer here (half way down)

"The physicists defer only to mathematicians, and the mathematicians defer only to God ..." - Leon M. Lederman

Offline

**krassi_holmz****Real Member**- Registered: 2005-12-02
- Posts: 1,905

Thank you very much.

IPBLE: Increasing Performance By Lowering Expectations.

Offline

**isthathomas****Member**- Registered: 2005-12-11
- Posts: 18

are you makeing a magic square waw!

Offline

**ganesh****Moderator**- Registered: 2005-06-28
- Posts: 21,496

This is one for you:-

16 2 3 13

5 11 10 8

9 7 6 12

4 14 15 1

It is no good to try to stop knowledge from going forward. Ignorance is never better than knowledge - Enrico Fermi.

Nothing is better than reading and gaining more and more knowledge - Stephen William Hawking.

Offline

**krassi_holmz****Real Member**- Registered: 2005-12-02
- Posts: 1,905

And interesting hard task:

Prove that there dosen't exist magic square of non-serial fibbonachi numbers.

IPBLE: Increasing Performance By Lowering Expectations.

Offline

Pages: **1**