Hi (Talking)

Hi,

Could anyone help with this proof? I need to use the chinese remainder theorem, but have no idea where to start? Does anyone have any ideas?

To check if f(x, y) = 0 (mod m) has integer solutions where

m > 1 and m in Z. It suffces to check it for prime powers, where m = p^k where k is bigger than or greater than 1

and where p is a prime.

Any ideas or hints would be great!

Thanks!