Last visit was: 11 Dec 2024, 13:38 It is currently 11 Dec 2024, 13:38
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
CrackverbalGMAT
User avatar
GMAT Club Legend
Joined: 03 Oct 2013
Last visit: 11 Dec 2024
Posts: 4,879
Own Kudos:
8,136
 [6]
Given Kudos: 224
Affiliations: CrackVerbal
Location: India
Posts: 4,879
Kudos: 8,136
 [6]
1
Kudos
Add Kudos
5
Bookmarks
Bookmark this Post
User avatar
chetan2u
User avatar
RC & DI Moderator
Joined: 02 Aug 2009
Last visit: 10 Dec 2024
Posts: 11,436
Own Kudos:
37,969
 [1]
Given Kudos: 333
Status:Math and DI Expert
Products:
Expert reply
Posts: 11,436
Kudos: 37,969
 [1]
Kudos
Add Kudos
Bookmarks
Bookmark this Post
avatar
Rithi07
Joined: 19 May 2019
Last visit: 21 May 2019
Posts: 1
Posts: 1
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
CrackverbalGMAT
User avatar
GMAT Club Legend
Joined: 03 Oct 2013
Last visit: 11 Dec 2024
Posts: 4,879
Own Kudos:
8,136
 [3]
Given Kudos: 224
Affiliations: CrackVerbal
Location: India
Posts: 4,879
Kudos: 8,136
 [3]
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
This is a moderately difficult problem that tests your knowledge on a specific remainder concept. This concept is,

"If ‘x’ is a prime number, (x-1)! will leave a remainder of (x-1) when divided by x. "

Put in simple words, this means that (x-1)! + 1 will be a multiple of x only if x is prime. Hence, in this question, we are essentially trying to find out if ‘x’ is prime.

From statement I alone, x can be 3 or 5 or 7 or 9. We cannot answer the main question with certainty, because 3,5, and 7 are prime while 9 is not. So, statement I alone is insufficient.
Answer options A and D can be ruled out, possible answer options are B, C or E.

From statement II alone, there cannot be any doubt at all. The statement says that ‘x’ is prime and this is what we are trying to find out.
In other words, we can say for sure that, since x is a prime numbers, (x-1)! + 1 will be divisible by x. Statement II alone is hence sufficient.

Therefore, the correct answer option is B.

If you were not familiar with the concept mentioned above, the alternative approach is to try values and see if a pattern develops. With statement I, you only have to try 4 values.
But, when it comes to statement II, it’s natural to worry about how many values you need to try, because there are infinitely many prime numbers. However, the fact about GMAT problems is, if a pattern is not there, it will become apparent to you in the first few instances itself; it’s not that the pattern breaker will reveal itself after 20 values. So, if you see a pattern developing after 4 or 5 values, go ahead and mark the answer.

Of course, the more foolproof of the two methods is the one using concepts. The best method, perhaps, is a combination of the both. Don’t you think so!

Hope this helps!
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 35,788
Own Kudos:
Posts: 35,788
Kudos: 929
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
Moderator:
Math Expert
97813 posts