Following on from 12 Ways
: find the smallest number that can be represented as the sum of two distinct squares of positive integers in exactly 1000
(In reply to Making inside info public: Hint (credit to Jer)
Following some links around on this site. You can find a solution by broll with a bit of a method. This leads me to believe the solution can be neatly expressed by the product of a few prime factors. I haven't had the mental energy to figure out quite how it works.
Posted by Jer
on 2011-09-23 23:35:17