Is there a fast way ($O((\log n)^c)$) to solve $$ax+by+xy=n$$ over integers when $a,b$ are known and $0<x,y<a,b$ holds?
Asked
Active
Viewed 166 times
2
-
http://dx.doi.org/10.1090/S0025-5718-1968-0224543-9 – Rodrigo de Azevedo May 30 '16 at 03:08
1 Answers
2
$$ (x+b)(y+a) = n + ab $$ four
Will Jagy
- 139,541
-
-
-
3@student, I don't see how bounds would change much unless they would immediately rule out all, or almost all, solutions. If $n+ab$ is prime then $x+b = \pm 1, \pm n,$ similar for $y+a.$ On the whole, problems filled with variables do not allow you to predictably take advantage of special features. – Will Jagy May 30 '16 at 02:48
-
-
@mvw i said I could not post the answer because i had four too few characters. Then I forgot about it. – Will Jagy May 30 '16 at 03:26
-