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

Home > Numbers
Multiply Together, Get Cubic (Posted on 2007-06-21) Difficulty: 4 of 5
Determine all possible integer pairs (p,q) such that p+q+s=pqs, where s=gcd(p,q) and gcd denotes the greatest common divisor.

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

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts Some steps? | Comment 3 of 8 |
If gcd(p,q)=s, then we can write p=as, q=bs, with gcd(a,b)=1. Replacing, as+bs+s= abs, so a+bs+s= abs, and then (ab-1)s-bs-a=0. The positive solution is (b+√(b^4+4a(ab-1)))/(2ab-2), so necessarily b^4+4a(ab-1) must equal r for integer r. (This is not a sufficient condition, by the way.)

I checked Charlie's results, and fortunately they agree with this condition, but I couldn't solve it directly, or prove that there are no more possibilities.

Edited on June 21, 2007, 11:18 am
  Posted by Federico Kereki on 2007-06-21 11:17:35

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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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