Given a prime number n≥5. Prove that for any natural number a≤2n, we can search for natural number b≤2n so the number of non-negative integer solutions (x,y) of the equation ax+by=n to be odd*.Clarification:
* For example when n=7,a=3, we can chooseb=1 so that there number of solutions og 3x+y=7 to be 3 (odd), namely: (0,7),(1,4),(2,1) number theoryDiophantine equationIntegers