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

You are not logged in.

## #1 2005-12-12 07:08:25

krassi_holmz
Real Member

Offline

### 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-12 07:09:34)

IPBLE:  Increasing Performance By Lowering Expectations.

## #2 2005-12-12 07:33:31

MathsIsFun

Offline

### 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

## #3 2005-12-12 19:06:56

krassi_holmz
Real Member

Offline

### Re: Magic square computation

Thank you very much.

IPBLE:  Increasing Performance By Lowering Expectations.

## #4 2005-12-12 22:04:28

isthathomas
Member

Offline

### Re: Magic square computation

are you makeing a magic square waw!

## #5 2005-12-13 19:23:48

ganesh
Moderator

Offline

### 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

Character is who you are when no one is looking.

## #6 2005-12-18 06:23:46

krassi_holmz
Real Member

Offline

### 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.