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

Home > Numbers
Sum Two Squares (Posted on 2007-11-02) Difficulty: 3 of 5
Determine all possible triplets of positive integers (p, q, r) satisfying p = q2 + r2 with q ≤ r such that gcd (q, r) = 1 and qr/s is a positive integer for every prime s ≤ √p

Note: gcd denotes the greatest common divisor.

No Solution Yet Submitted by K Sengupta    
Rating: 2.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution | Comment 1 of 2

(5,1,2) and (13,2,3).

5 = 12 + 22;   1 <= 2;   gcd(1,2) = 1
1*2/2 = 1;   2 <= SQRT(5)  ~=2.236

13 = 22 + 32;   2 <= 3;   gcd(2,3) = 1
2*3/2 = 3;   2 <= SQRT(13)  ~=3.606
2*3/3 = 2;   3 <= SQRT(13)  ~=3.606

Edited on November 2, 2007, 10:21 am
  Posted by Dej Mar on 2007-11-02 10:19:07

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 (8)
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