Bunuel
What is the remainder when positive integer x is divided by 12?
(1) When x is divided by 4, the remainder is 3.
(2) When x is divided by 36, the remainder is 27.
(1) When x is divided by 4, the remainder is 3.
Generic form p = 4q + 3
Taking a few examples
p can be 3, 7, 11, 15, 19.....
Dividing these numbers by 12 would result in different remainders.
If p = 7, remainder is 7
If p = 15, remainder is 3
--> Not Sufficient
(2) When x is divided by 36, the remainder is 27.
Generic form p = 36q + 27
Mathematically 36q would always be divisible by 12, hence, we only need to check for 27 and that will always leave a remainder of 3
Taking a few examples
p can be 27, 63, 99.....
Dividing these numbers by 12 would result in the same remainder
If p = 27, remainder is 3
If p = 63, remainder is 3
If p = 99, remainder is 3
--> Sufficient
IMHO Option B