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.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
40! mod 41 = 40 (any prime number - 1) mod prime number = prime number - 1 39! mod 41 = 1 (any prime number - 2) mod Prime number = 1
Think about it.
Proof to follow....
Show more
Actually, I don't think this is a fair GMAT question. The problem is an application of "Wilson's Theorem" which is far beyond the knowledge needed for the GMAT. I would be happy to see an answer that has a solution which falls under GMAT-required knowledge.
when 40! / 41 remainder is 40 since except 40 other terms are divisble by 41 and hence the remainder is 40/41 i.e. 40 .
Show more
Hmmmm. Please demonstrate to me some proof or method to determine that (40! + 1) is divisible by 41. This is the same as saying 40! mod 41 = 40. Essentially, you are using the answer to the problem to find the answer -- circular logic.
If you are claiming that (n! + 1) is always divisible by n + 1, THAT IS WRONG; here is a simple counter example: (3! + 1) = 7 which is certainly NOT divisible by 4.
The ONLY time (n! + 1) is divisible by n + 1 is when n + 1 is PRIME, which is the essense of Wilson's formula and which no GMAT student should be expected to know.
Nuff said.
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.