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

Home > Just Math
Square sum with 5-6-7 (Posted on 2010-08-13) Difficulty: 3 of 5
Sloane’s sequences A025306, A025307 and A025308 gives the respective lists of positive integers (having at most 7 digits) that are the sum of 2 distinct nonzero squares in exactly n ways, whenever n= 5, 6 and 7.

Determine the respective maximum value and minimum value of an 8-digit base ten positive integer P, such that P is expressible as sum of 2 distinct nonzero squares in exactly n ways, whenever n = 5, 6 and 7. (P does not contain any leading zero.)

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsSome boundsbroll2010-08-13 05:55:56
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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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