Last visit was: 24 Apr 2026, 01:05 It is currently 24 Apr 2026, 01:05
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
Major Poster
Joined: 03 Oct 2013
Last visit: 23 Apr 2026
Posts: 4,846
Own Kudos:
9,181
 [6]
Given Kudos: 226
Affiliations: CrackVerbal
Location: India
Expert
Expert reply
Posts: 4,846
Kudos: 9,181
 [6]
1
Kudos
Add Kudos
5
Bookmarks
Bookmark this Post
User avatar
chetan2u
User avatar
GMAT Expert
Joined: 02 Aug 2009
Last visit: 22 Apr 2026
Posts: 11,229
Own Kudos:
45,006
 [1]
Given Kudos: 335
Status:Math and DI Expert
Location: India
Concentration: Human Resources, General Management
GMAT Focus 1: 735 Q90 V89 DI81
Products:
Expert
Expert reply
GMAT Focus 1: 735 Q90 V89 DI81
Posts: 11,229
Kudos: 45,006
 [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
Major Poster
Joined: 03 Oct 2013
Last visit: 23 Apr 2026
Posts: 4,846
Own Kudos:
9,181
 [3]
Given Kudos: 226
Affiliations: CrackVerbal
Location: India
Expert
Expert reply
Posts: 4,846
Kudos: 9,181
 [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: 38,965
Own Kudos:
Posts: 38,965
Kudos: 1,117
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderators:
Math Expert
109802 posts
498 posts
212 posts