If p and q are positive integers, what is the remainder when p^2 + q^2 is divided by 5?
(1) When p - q is divided by 5, the remainder is 1.
(2) When p + q is divided by 5, the remainder is 2.
1) When p = 3, q = 2, then p^2 + q^2 = 9 + 4 = 13 (when divided by 5, remainder is 3) . Again when, p = 2, q = 1, p^2 +q^2 = 5 (remainder is 0). Not sufficient.
2) p = q = 1, then p^2 + q^2 = 2 ( remainder is 2). When, p = 5, q = 2, p^2 + q^2 = 29 (remainder is 4). Not sufficient.
Together, p- q = 5k + 1.....(i)
and, p + q = 5k + 2.....(ii)
Now, p = 4, q =3 will meet both the equations, p^2 + q^2 = 25 (remainder is 0). Again, when p = 9, q =8, p^2 + q^2 = 81 + 64 = 145 (divisible by 5). So, we can infer that p and q will be consecutive integers and p > q. When p is even , we can write the sum as (2k)^2 +(2k -1)^2 = 4k^2 + 4k^2 - 4k + 1 = 8k^2 - 4k + 1. For k = 1, it will be 5. For k =2, it will be 32 - 8 + 1= 33 - 8 = 25, always divisible by 5.
When p is odd,p^2 + q^2 = (2k+1)^2 + (2k)^2 = 4k^2 + 4k + 1 + 4k^2 = 8k^2 + 4k +1. Now, as p + q is at least 2, and p - q is at least 1, so k can assume values as integers that is 1 less than multiples of 5 (e.g 4, 9, 14, 19 etc ). When, p = 19, the sum will be ....1 + ...4 = an integer ending with 5, so the remainder in all cases will be 0.
C is the answer.