This problem was inspired by the infamous problem 6 in the 1988 Math Olympiad:
When is a2+b2 divisible by (ab+1)2 where a and b are non-negative integers?
A computer search finds only cases where a or b is zero and a^2 + b^2 is of course divisible by 1, up to a total of a+b in the thousands.
Edited on June 17, 2018, 6:24 pm
Posted by Charlie
on 2018-06-17 18:23:05