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.)
Some Thoughts re(2): Making inside etc - will comment later. | Comment 3 of 5 |
(In reply to re: Making inside info public: Hint (credit to Jer) by Jer)

I am on vacation in Montenegro and find this issue interesting enough to be addressed in, say, 10 days from now.
  Posted by Ady TZIDON on 2011-09-24 08:24:04

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


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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information