The original problem was perhaps too computationally simple
to be interesting. The following additional condition adds an
iota of complexity:
The 25 distinct primes in the square should be the first 25
odd primes {3,5,7,...,97,101}.
(I have a solution which wasn't hard to find by trial and error,
so there must be many solutions; but plain brute force on the 25!
such possible squares is obviously too computationally costly.)
Last fiddled with by davar55 on 20080513 at 18:08
