View Single Post
Old 2008-05-13, 18:07   #4
davar55
 
davar55's Avatar
 
May 2004
New York City

23·232 Posts
Default

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 2008-05-13 at 18:08
davar55 is offline   Reply With Quote