I came across a problem in the set of number theory in which it involves solving of diophantine equations. (Especially this problem: https://brilliant.org/community-problem/a-number-theory-problem-by-souryajit-roy-2/?group=0RqFFfJZARDI&ref_id=211256) Some of the problems which involve diophantine equations of degree 2 or more are (really hard?) to solve. I tried to give information about the possible solutions and yes, I found some but I wasn't able to put all the solutions out. In despair, I used trial and error. And the worst case, I used Python to find all the solutions and it turned out there may be large increase from first solution to next solution. Do these kind of problems really require (not just for checking) programming language to get all the solutions? If not, what might be some techniques or theorems in which we are sure to get the solutions?