Project Euler #141: Investigating progressive numbers, n, which are also square.

  • + 0 comments

    Finally solved this one. My algorithm takes around 1.5 second for T=10^5.