Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Sep 0609:30 AM EDT
-12:30 PM EST
Top scores are possible when you enroll in a powerful EA course, taught live online + 6 months access to TTP OnDemand video courses included! Perfect class schedule and easy course access for working professionals. Class starts Sundays Sept. 6, 2026.
Sep 0201:00 PM EDT
-11:59 PM EDT
Take 30% off all study plans with code COURSEWORK - Expires on Monday 9/7
Sep 0410:00 AM EDT
-11:59 PM EDT
We’ve worked incredibly hard to build TTP into the best test prep experience possible, and it would mean a lot to us to win Newsweek’s 2026 Readers’ Choice Award for Best Test Prep. If TTP has helped you, we’d be incredibly grateful for your vote.
Sep 0712:01 AM PDT
-11:59 PM PDT
On the 7th, GMAT Club Tests will be Free! Including all the Quizzes, Questions, and Tests. 12 AM - 11:59 PM PDT- Sep 07
10:00 AM PDT
-11:00 AM PDT
A complete walkthrough of GMAT Club’s free 12-week GMAT study plan: what you study each week, how progress and goals are tracked, how the error log works, and how your practice unlocks paid tools at no cost. - Sep 09
07:00 AM PDT
-10:00 AM PDT
Meet AdComs and explore top Master’s programs - MiM, MiF, MSc, MSBA and more. - Application Fee Waivers - Free 1-Week of GMAT Club Tests: - Master's Application Toolkit - Grand Prize Giveaway - Sep 09
10:00 AM PDT
-11:00 AM PDT
Three MBA applications. Three rejections. No interview invites. A year later, Aman was admitted to Cambridge Judge, SMU, and IMD. In this episode of MBA Admit Stories, Aman shares how he rebuilt his MBA application... 
Sep 1507:00 PM EDT
-09:00 PM EST
Elite scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thurs Sept. 15, 2026 - Nov. 15, 2027, 7:00pm-9:00pm EST
Sep 2108:00 PM EDT
-10:00 PM EDT
Boost your GMAT score in less than one month in a live online class + 6 months access to TTP OnDemand video courses included! Class starts Mon, Tues, Wed, Thur, Fri Sept. 21, 2026 - Oct. 9, 2027, 7:00pm-10:00pm EST
E
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
65%
(hard)
Question Stats:
53% (01:58) correct
47%
(01:52)
wrong
based on 142
sessions
History
Date
Time
Result
Not Attempted Yet
If n and k are integers greater than 0. What is the remainder when (n - 1)! is divided by kn ?
(1) n is not a prime number
(2) k < 2
(1) n is not a prime number
(2) k < 2
17 Sep 2010, 07:33
Kudos
Bookmarks
shrouded1
How is the answer C?
Well, clearly each statement alone is not sufficient.
(1)+(2) \(0<k=integer<2\) --> \(k=1\), so we are looking for the remainder when \((n-1)!\) is divided by \(n\neq{prime}\). If \(n=4\neq{prime}\) then \((n-1)!=6\) divided by 4 yields remainder of 2 but if \(n=6\neq{prime}\) then \((n-1)!=120\) divided by 6 yields remainder of 0. Two different answers. Not sufficient.
Answer: E.
I think the question intends to use the theorem which states that \((n-1)!\) is always divisible by \(n\) if \(n\) is not a prime number. But it's true only if \(n>4\).
So C to be an answer, statement (1) should state: \(n\) is greater than 4 and \(n\) is not a prime number.
General Discussion
17 Sep 2010, 07:21
Kudos
Bookmarks
(1) obviously insufficient we don't know anything about k
(2) k < 2 so k = 1
In that case, either n is prime, or n is not prime.
If n is prime, (n-1)! is not divisible by n and will give each time a different remainder.
If n is not prime, (n-1)! is divisible by and will give a remainder = 0. If your are not convinced, use example !!
(1) and (2) : using the previous argument, the remainder will be 0 every time!
ANS: C.
Hope it's clear
(2) k < 2 so k = 1
In that case, either n is prime, or n is not prime.
If n is prime, (n-1)! is not divisible by n and will give each time a different remainder.
If n is not prime, (n-1)! is divisible by and will give a remainder = 0. If your are not convinced, use example !!
(1) and (2) : using the previous argument, the remainder will be 0 every time!
ANS: C.
Hope it's clear
