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

Home > Just Math
Additively Quadratic (Posted on 2008-04-19) Difficulty: 3 of 5
Determine all possible positive integer triplet(s) (F, G, H) such that each of F and G is a prime with FG, and:

F(F+3) + G(G+3) = H(H+3)

See The Solution Submitted by K Sengupta    
Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution | Comment 5 of 6 |
F(F+3)+G(G+3)=H(H+3) where F and G are both primes and
F≤G
=> 3(F+G-H)=(H²-F²-G²)
Let F and G be primes other than 3
then F² mod 3 = G² mod 3 = 1
H² mod 3 = 0 or 1
So, (H²-F²-G²) mod 3 = 2 or 1
In this case, RHS is not divisible whereas LHS is
divisible by 3. So, atleast one of F,G must be 3.
case(1): Let F=3
=> 3*6=H²+3H-G²-3G
=> 18 = (H-G)*(H+G+3)
We know that H>G≥F{=3} => H+G+3>9
The only divisor of 18 greater than 9 is 18
So, H+G+3=18 and H-G=1 => G=7 and H=8
{3,7,8} is one triplet.
case(2): Let G=3
F can be 2 or 3 according to given conditions

If F=3
H²+3H-36=0 No integer solutions to this quadratic
since its discriminant 153 is not a perfect square

and If F=2
H²+3H-28=0 => (H+7)(H-4)=0
As H is positive, H=4
{2,3,4} is another triplet that satisfies the given
equation.

  Posted by Praneeth on 2008-04-22 07:34:53
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 (3)
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