When n and k are positive integers, what is the greatest common divisor of n+k and n?
1) n=2
2) k=1
==> In the original condition, there are 2 variables, and in order to match the number of variables to the number of equations, there must be 2 equations. Since there is 1 for con 1) and 1 for con 2), C is most likely to be the answer. By solving con 1) and con 2), you get n+k=2+1=3 and n=2, and GCD(3,2)=1, hence it is unique and sufficient. Therefore, the answer is C. However, this is an integer question, one of the key questions, so you apply CMT 4 (A: if you get C too easily, consider A or B).
For con 1), k is unknown hence it is not sufficient.
For con 2), if k=1, n+k(=n+1) and n becomes 2 consecutive integers, so always GCD=1, hence it is unique and sufficient.
Therefore, the answer is B, not C.
Answer: B