When a positive integer n is divided by 2, what is the remainder?
1) The remainder is 1 when n is divided by 5
2) The remainder is 1 when n is divided by 10
==> In the original condition, there is 1 variable (n) and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer. For remainder questions, you can solve it by using direct substitution.
For con 1), from n=5p+1(p=any positive integer), you get n=1,6,… However, from n=1=2(0)+1, you get r=1, but n=6=2(3)+0, you get r=0, hence it is not unique and not sufficient.
For con 2), from n=10q+1(q=any positive integer), you get n=1,11,21,… However, for all cases, the remainder=1, hence it is unique and sufficient.
Therefore, the answer is B.