What is the remainder when positive integer m is divided by 14?

Thank you Bunuel for the links and the clear explanation. Truly appreciate it

There is 1 variable (m) in the original condition. In order to match the number of variables and the number of equations, we need 1 equation. Since con 1) and con 2) each has 1 equation, there is a high chance that D is the correct answer. We can substitute the other parts.
In case of con 1), if we divide m=28p+5=5, 33, 61,.... by 14, the remainder is always 5. The answer is unique and the condition is sufficient.
In case of con 2), the number that satisfies m=2q+1=7n+5 is 5, which is the remainder of dividing m by 14. The answer is unique and the condition is sufficient. Hence, the correct answer is D.

- For cases where we need 1 more equation, such as original conditions with “1 variable”, or “2 variables and 1 equation”, or “3 variables and 2 equations”, we have 1 equation each in both 1) and 2). Therefore, there is 59 % chance that D is the answer, while A or B has 38% chance and C or E has 3% chance. Since D is most likely to be the answer using 1) and 2) separately according to DS definition. Obviously there may be cases where the answer is A, B, C or E.

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.