A magic square is loosely defined as a square divided into smaller squares each containing a number, such that the numbers in each columns, in each rows, and in the diagonal add up to the same value. For this problem, the numbers which will be filling the squares are primes. There is no unique answer to the problem; therefore, your answers will be tested against the requirement.
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers12
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1331 Solvers
-
Find the maximum number of decimal places in a set of numbers
3611 Solvers
-
Multiples of a Number in a Given Range
946 Solvers
-
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
405 Solvers
-
Find x rows where the sum of the numbers is the maximum
613 Solvers
More from this Author180
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Is there an algorithm for this?
@Ramon yes; for instance, you could consider all (n^2)-tuples of distinct primes in order of their sum until you find one that happens to yield a magic square. Practical algorithms, on the the hand --- I'm not aware of any.