All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
1000 ways (Posted on 2011-09-23) Difficulty: 3 of 5

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 different ways.

See The Solution Submitted by broll    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Making inside info public: Hint (credit to Jer) | Comment 2 of 5 |
(In reply to Making inside info public: Hint (credit to Jer) by Charlie)

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

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information