tomcal36dc
Another question I answered incorrectly:
If x is a positive integer, is x! + (x + 1) a prime number?
(1) x < 10
(2) x is even
the only way I was able to simply this question stem is "can X! + (x+1) be divided by any other number?" and X! + (x+1) = x*(X-1)*(x-2) etc + (x+1)
I started with (2). if x is even, (x+1) = Odd, and x! must be even, so odd+even = odd, so there is a better chance it is prime (at least its not even)
(1) I just tested some cases that are less than <10, but not all of them because I didnt want to waste time.
x=2 --> 2+3 = prime,
x=3 --> 6+4 = not prime
Thus insufficient
(T). I think I tested a couple cases of evens less than 10, working my way up, but not all of them (i stopped at x=6)
x=2 --> 2+3 = prime,
x=4 --> 4*3*2 + 5 = 24+5 = 29
x=6 --> 6*5*4*3*2 + 7 = 720 + 7 = 727
maybe i should test all the divisibility rules now. I do not know all of them by heart yet. I MAY have tested 3 (7+2+7 = 16, thus not divisible by 3)
at this point I think I just concluded that 727 was prime, and thus all of the even integers less that 10 put into this formula create a prime number, thus Sufficient
--> looking back, my answer was B, I guess because I decided from this small pattern that all even integers in this formula create prime numbers
...I probably sound pretty ridiculous with my pathetic reasoning in these posts, although I consistently score 44-49 on Quant, but I want to consistently score 45-50. [I guess this answers your above post
Quote:
3. Do you do this mistake on difficult questions only or supposedly easy ones too?
--> the questions I am missing do tend to be difficult, upper level questions.
I will post another example or two tomorrow...but do these explanations suffice?
I categorize this question as another difficult question. 650-700 level.
Reasons:
1. This question seems difficult.
2. The number plugging may result in incorrect answer, at the same time plugging would be better approach to solve this.
3. Difficult to rephrase or to shorten.
For this questions, I won't solve each statement independently. I'd rather take the reverse approach. Call it hunch if you may.
So, I assume St1 and St2 to be true and try to solve it.
Integer less than 10 and even.
2,4,6,8
Write them down in values;
2!+3
4!+5
6!+7
8!+9
Here, my knowledge of factorization tells me that 8!+9 will not be prime and rest everything will be;
This will be true for all x+1: that are prime
How so; let's see
2!+3=2*1+3 --- Here from the two terms I can't take anything common
4!+5=4*3*2+5 ---Here also from the two terms I can't take anything common
6!+7=6*5*4*3*2+7---Here also from the two terms I can't take anything common
8!+9----- 8*7*6*5*4*3*2+3*3=8*7*(3*2)*5*4*3*2+3*3=3*3(8*7*2*5*4*2+1) -- Here since I took 9 common from both terms, I am certain that the entire expression is divisible by 9 and thus NOT prime.
Now, here I used both the statements true and yet couldn't prove its sufficiency. Thus, the statements must together be insufficient.
******************************************************************************
Now, why couldn't you do it. Just because you didn't know the pattern to solve such type of questions. Now you know it and henceforth can apply this factoring common value from both terms. The more problems you do in factorials, the more acquainted you will become with the patterns and start solving such questions faster and without error.
Thus, I would say two things for this.
Practice and doubt a little your plugging number method when you are using it as basis to declare a statement sufficient.
PIN- Good to make expressions/statements insufficient.
PIN-NOT so good to make expressions sufficient.
********************************************************
I recommend this. Chances of finding a question that you did incorrectly are really good. Thus, search for a particular question that you missed and see whether you get an appropriate/satisfactory answer in the discussion. If not, just reply in the same thread so that others may get a chance to look at it and suggest various strategies to solve that.
*****************************
All the best!!!