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: ( You must be logged in to post comments.)
  Subject Author Date
re: Solution extra "trivial" solutionDaniel2007-11-02 18:03:46
SolutionSolutionDej Mar2007-11-02 10:19:07
Please log in:
Remember me:
Sign up! | Forgot password

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

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