One simple thing about prime number is they are rarely predictable and there is no formula to generate a prime number. A prime number may be represented in a particular form but that particular form will not always generate prime numbers.varun289 wrote:If j > 1, is integer j a prime number?
(1) When j is divided by 3, the remainder is 1.
(2) When j is divided by 2, the remainder is 1.
So, whenever you come across this type of problem, combine both statements together and try to find contradiction. In fact, with practice you'll happen to know that answer to this particular problem is definitely E. Find a contradiction just to be more confident.
Here, if we combine both statements, it simply means when j is divided by 6 it leaves a remainder of 1. So, j is one more than a multiple of 6.
7 = 6*1 + 1 ---> 7 is prime
25 = 6*4 + 1 ---> 25 is not prime
We have our contradiction.
So, both statements together is also not sufficient.
The correct answer is E.
Go through this discussion made by Anurag on a problem testing the same concept (please scroll down and read his follow-on posts also) >> https://www.beatthegmat.com/num-prp-t74492.html#335738













