How do I check if a general nth degree diophantine equation has integer solutions or any solutions? Is there a general algorithm for this?
I have seen answers on the internet using congruence modulo but I simply don't get why or how they find the number to which modulo is taken. And how they conclude that there are solutions or not. A generalized elaboration would help immensely.