Find the sum of all distinct a ∈ N for which there exists a positive integer b such that a + b 2 + ( g cd ( a , b ) ) 3 = a b ⋅ g cd ( a , b ) .
Details and assumptions
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Okay, I didn't solve this problem mathematically. I wrote the python code:
1 2 3 4 5 6 |
|
and it returns a small solution set:
[4, 2]
[4, 6]
[5, 2]
[5, 3]
4 + 5 = 9
If a and b have a common factor>1, then we let a = p α . A , b = p β . B and d = p m i n α , β . D , where A,B and D are coprime to p and alpha and beta are >0.Then by looking at v p L H S and v p R H S , we conclude that α = 2 . β is the only possible case.Consequently a = b 2 , yielding the solution a = 4 .Now if a and b are coprime ,then d=1 and we factor in the following manner:
b 2 − 1 + 2 = a ( b − 1 ) , which means that b − 1 ∣ 2 , leaving the only other solution where a=5 and b=2 or 3.
So the answer is 9.
How exactly is α = 2 ⋅ β ? What is D ? I got the answer 9, and I think we follow similar paths, but this isn't clear at all.
Log in to reply
Well just represent a, b and d in the mentioned way and take the highest power of p that divides all of them.It has to be the highest power of p that divides RHS.But for alpha being different from 2 beta we get that alpha and beta are equal to 0, a contradiction.Also D=(A,B) and d=(a,b).
Set f (a, b) = a + b^2 + (gcd (a, b))^3 - a b gcd (a, b),
f (4, 2) = 4 + 2^2 + 2^3 - (4)(2)(2) = 16 - 16 = 0;
f (5, 2) = 5 + 2^2 + 1^3 - (5)(2)(1) = 10 - 10 = 0;
f (4, 6) = 4 + 6^2 + 2^3 - (4)(6)(2) = 48 - 48 = 0;
f (5, 3) = 5 + 3^2 + 1^3 - (5)(3)(1) = 15 - 15 = 0;
Minimum magnitude f (b + 1, b) = 2 always happens example when 32 x 31 of search using Excel is implemented. As told by the question, a value of b = 2 for a = 4 or 5 shall be the only answer. Therefore two distinct 'a' of 4 + 5 = 9.
Problem Loading...
Note Loading...
Set Loading...
What I did is by completing the squares where we solve b in terms of a and their GCDs....
b = 2 a g cd ( a , b ) ± [ a × g c d ( a , b ) ] 2 − 4 ( a + g cd ( a , b ) ] 3 ) )
We let d = g c d ( a , b )
And we have to make the expression inside the radical integral. By completing the squares...
( a d ) 2 − 4 ( a + d 3 ) = k 2 ( k is an integer)
⟹ a d − ( d 2 ) 2 − 4 d 3 = k 2 + ( d 2 4 )
If d ∣ 2 , then d = 1 or 2 , which implies a = 5 and 4 respectively.
What is not complete: For d > 2 , I checked the base cases for d = 3 , 4 and what I found out and conjectured:
If d ∣ 2 , then there exists a and b that are positive integers that satisfy the equation and for d more than 3, there is not. When there is a solution, but it doesn't satisfy the conditions.
I'll try to prove this....