all pairs (a,b) of positive integer satisfying : (a^2 + b)|(a^2*b+a) and (b^2 - a)|(ab^2 + b)
i guess to solve one by one for (a^2 + b)|(a^2*b+a) and (b^2 - a)|(ab^2 + b) then find intersect, right ?
is it not that the condition is \(a^2b+a\) is divided by \(a^2+b\)??
dan interpreted the problem in another way, right?
i dunno man im just moving stuff aroudn
u cud do that too i guess, and do some sythetic division
yeah, in other words a^2 + b is divisible by a^2 * b + a and .... @Loser66
ya u are right
a * b = c * d a b c d are all integers so
but it doesnt mean they have to be divisible
ah , if i use the long division get a = b^2 for the first one
like (p1*p2) * (p3*p4) = (p3*p2*p1) * (p4) this could happen and p1*p2 is not divisible by p4
is b = a+1 the ansur ?
how ? btw it is not options question, so i dont know
it seem to work, check once
I'll put the solution shortly..
omg i didnt see that Division sign thing
give me a little hint
lmao
thats hard to see on my computer lol
can you double check if it is really working or not i don't have a rigorous proof yet, still working..
so we are basically solving a system of modular equatiosn right
yes, b = a + 1 is satisfying both for (a^2 + b)|(a^2*b+a) and (b^2 - a)|(ab^2 + b)
|dw:1426990817871:dw|
Join our real-time social learning platform and learn together with your friends!