Here is my method for DS, which I call pre-workout. In most of the times, when I see formulae in question stem of DS I try first to modify them.
2^p + 1 a prime number? We know that any prime number can be expressed as 6n+1 or 6n-1, so
a. 2^p + 1=6n+1, 2^p =6n, 2^p =2*3*n - never a case, because 2^p can not have 3.
b. 2^p + 1=6n-1, 2^p =6n-2, 2^p =2*(3n-1), (3n-1) - has to be 2, 8, 32 ..., or p=2,4,6... - we have to find an option that gives us p=even
(1)+(2) states that p=2 - the only prime number that is even. Answer (C)
P.S. From the beginning this method seems to be slower, but it certanly has several benefits:
1. It allows you to narrow down to information that you are looking for, and not to be confused with fluff in options
2. In some cases it's easier to conduct calculations with only one formula in the beginning
3. Sometimes plug-in method can be very messy, because you have a lot of scenarios.