x = 11a + r1
y = 11b + r2
where a and b are integers
(1)
x-y = 11(a-b) + (r1-r2) = 11k
r1 and r2 can range from 1 to 10, because
remainders can't be zero since x and y are not divisible by 11, remainders are obviously above zero and remainders have to be less than 11 => 1 to 10
first term on the RHS is divisible by 11, second term has to be divisible by 11, which can only happen when r1=r2 given the constraints mentioned in the sentence right before this one
so the remainders are same
Sufficient
(2)
r2 = 2
r1 = whatever, answer is fixed and hence the conditions are
Sufficient
In (2) by the way, if someone really wants to solve
{10^52 + 1}/11 can be written as
{(11-1)^52/11 + 1/11}
and the remainder of the complete expression is sum of remainders of individual terms just like always
so remainder = 0 + remainder of {(-1)^52/11} + 1 (this follows from some crazy-a** binomial expansion)
= 0 + 1 + 1 = 2
Again, sufficient
Remainder of this complete expression is