Math Is Fun Forum
You are not logged in.
- Topics: Active | Unanswered
Pages: 1
#1 2005-12-11 08:08:25
- krassi_holmz
- Real Member
- Registered: 2005-12-02
- Posts: 1,905
Magic square computation
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
#2 2005-12-11 08:33:31
- MathsIsFun
- Administrator
- Registered: 2005-01-21
- Posts: 7,713
Re: Magic square computation
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
#3 2005-12-11 20:06:56
- krassi_holmz
- Real Member
- Registered: 2005-12-02
- Posts: 1,905
Re: Magic square computation
Thank you very much.
IPBLE: Increasing Performance By Lowering Expectations.
Offline
#4 2005-12-11 23:04:28
- isthathomas
- Member
- Registered: 2005-12-11
- Posts: 18
Re: Magic square computation
are you makeing a magic square waw!
Offline
#5 2005-12-12 20:23:48
- Jai Ganesh
- Administrator
- Registered: 2005-06-28
- Posts: 48,421
Re: Magic square computation
This is one for you:-
16 2 3 13
5 11 10 8
9 7 6 12
4 14 15 1
It appears to me that if one wants to make progress in mathematics, one should study the masters and not the pupils. - Niels Henrik Abel.
Nothing is better than reading and gaining more and more knowledge - Stephen William Hawking.
Offline
#6 2005-12-17 07:23:46
- krassi_holmz
- Real Member
- Registered: 2005-12-02
- Posts: 1,905
Re: Magic square computation
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