Problem 49884. Prime Magic Squares
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
Ramon Villamangca
on 9 Nov 2021
Is there an algorithm for this?
Christian Schröder
on 15 Jul 2023
@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.
Solution Comments
Show commentsProblem Recent Solvers10
Suggested Problems
-
6830 Solvers
-
Project Euler: Problem 10, Sum of Primes
1717 Solvers
-
881 Solvers
-
285 Solvers
-
359 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!