1) n = 4k+2
If k >= 0, then\(3^n + 1\) will always be divisible by 10. This is because units digit of powers are 3 follow the cycle 3,
9,7,1,3,
9,7,1...and has a cyclicity of 4.
I.e, 3^(4k+2) has unit digit of 9. You can try with values k = 0, k = 1 and so on.
So 3^(4k+2) + 1 will always have units digit of 9 + 1 = 0.
However, in the question stem it is not mentioned that \(k >= 0\). So, if \(k < 0\), \(3^n+1\) will return fractional results - as pointed out by thyagi.
If k fractional, k = 1/2, then n = 4*1/2 + 2 = 4.
Then the units digit of \(3^n+1\) is 2 and not 0.
Hence statement 1 is insufficient.
2) \(n > 4\).
\(3^5 + 1\) has units digit of 3 + 1 = 4, \(3^6 + 1\) has units digit of 9 + 1 = 0. Two different unit's digits, one not divisible by 10 and the other is divisible by 10. Hence, insufficient.
Both statements together, we can eliminate the scenario where k < 0. So n > 4, that means k > 0. So, \(3^n + 1\) = 3^(4k+2) + 1 will have units digit 0. However, the possibility of a fractional k is still there. So even statements 1 and 2 together also do not suffice.
Answer E