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.
i did it the same as duttsit did it. the number is a multiple of the primes 1...21. i tried 11 and got 2 for x.
How can you determine whether this number is divisible by 11 Christoff?
I understand Duttsit`s logic, but why not use 5 to get a numerical sum of 66?
Show more
How can you determine whether this number is divisible by 11 Christoff?
--> 21!= 1*2*3*4*....*11*12*......*20*21
that's why 21! is divisible by 11
but why not use 5 to get a numerical sum of 66 ----> you're right! It would be better to try 9 instead of 3 . The divisibility indicator of 9 is that the sum of all digits forming the number is divisible by 9. Only 63 satisfies this. Thus, x=2.
i did it the same as duttsit did it. the number is a multiple of the primes 1...21. i tried 11 and got 2 for x.
How can you determine whether this number is divisible by 11 Christoff?
I understand Duttsit`s logic, but why not use 5 to get a numerical sum of 66?
How can you determine whether this number is divisible by 11 Christoff? --> 21!= 1*2*3*4*....*11*12*......*20*21 that's why 21! is divisible by 11
but why not use 5 to get a numerical sum of 66 ----> you're right! It would be better to try 9 instead of 3 . The divisibility indicator of 9 is that the sum of all digits forming the number is divisible by 9. Only 63 satisfies this. Thus, x=2.
Show more
So essentially the divisibility rule for 3 and 9 are the same---->sum of the digits/3 or 9
[quote="christoph"]i did it the same as duttsit did it. the number is a multiple of the primes 1...21. i tried 11 and got 2 for x.
How can you determine whether this number is divisible by 11 Christoff?
I understand Duttsit`s logic, but why not use 5 to get a numerical sum of 66?
How can you determine whether this number is divisible by 11 Christoff? --> 21!= 1*2*3*4*....*11*12*......*20*21 that's why 21! is divisible by 11
but why not use 5 to get a numerical sum of 66 ----> you're right! :wink: It would be better to try 9 instead of 3 . The divisibility indicator of 9 is that the sum of all digits forming the number is divisible by 9. Only 63 satisfies this. Thus, x=2.
So essentially the divisibility rule for 3 and 9 are the same---->sum of the digits/3 or 9
Got it!! [/quote]
question:
since it's a factorial: 1*2*3*4*5...*20*21
could you (in theory) use any number as divisor to find the missing digit?
of course below a certain number, because you cannot add more than a certain number, if it will change the next digit...
right?
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.