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.
Apr 2601:30 AM EDT
-02:30 AM EDT
Learn how Keshav, a Chartered Accountant, scored an impressive 705 on GMAT in just 30 days with GMATWhiz's expert guidance. In this video, he shares preparation tips and strategies that worked for him, including the mock, time management, and more.
Apr 2512:30 AM EDT
-01:30 AM EDT
At one point, she believed GMAT wasn’t for her. After scoring 595, self-doubt crept in and she questioned her potential. But instead of quitting, she made the right strategic changes. The result? A remarkable comeback to 695. Check out how Saakshi did it.
Apr 2610:00 AM EDT
-11:00 AM EDT
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!
Apr 2711:00 AM EDT
-12:00 PM EDT
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
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
May 0111:00 AM PDT
-12:00 PM PDT
Free- full-length test + 15 concept videos + 150+ short videos + study plan!
15 May 2013, 11:23
Kudos
Bookmarks
Couldn't find this with basic search so posting it.
Basic concepts used:
1.) Abcd = 10^3 x A + 10^2 x b + 10^1 x c + 10^0 x d
2.) (A x B) mod p = (A mod p) X (B mod p) e.g. (13 x 11) mod 4 = (13 mod 4) x (11 mod 4) = 1 x 3 = 3 (or 1 x -1= -1 [=3] )
3.) (A+B) mod p = (A mod p) + (B mod p) e.g. (13 + 11) mod 4 = 13 mod 4 + 11 mod 4 = 1+(-1) =0 (or 1+3 =4 [=0])
Divisibility for 3 and 9:
Adding all the digits and checking if the sum is divisible by 3 or 9 e.g. 234 mod 9 = (2+3+4) mod 9 = 0 hence divisible.
Proof:
Let the number be of the form ‘abcd’.
Abcd mod 9 = (10^3 x A + 10^2 x b + 10^1 x c + 10^0 x d) mod 9
= (10^3) mod 9 x A mod 9 + 10^2 mod 9 x B mod 9 + 10 mod 9 x c mod 9+ d mod 9
= (10 mod 9 )^3 x A mod 9 + (10 mod 9)^2 x B mod 9 + (10 mod 9) x c mod 9 + d mod 9
=1 x A mod 9+ 1 x B mod 9 + 1 x C mod 9 + d mod 9
= (A+b+c+d) mod 9
We were able to do this because we know 10 mod 9 = 1. Similarly if we know the relation between 10^k and m (where k and m are positive numbers) we can find the divisibility rule for (any number) mod m.
For 7:
1000 mod 7 = -1
Let any 9 digit number be: abcdefghi
Abcdefghi= 10^8 x A + 10^7 x B+ …… + 10^0 X i
= 10^6(10^2 x A + 10^1 x B + 10^0 x C) + 10^3 (10^2 x D + 10^1 x E + 10^0 x F) + 10^0 x (10^2 x G + 10^1 x H + 10^0 x I)
Now (abcdefghi) mod 7 =
[10^6(10^2 x A + 10^1 x B + 10^0 x C) + 10^3 (10^2 x D + 10^1 x E + 10^0 x F) + 10^0 x (10^2 x G + 10^1 x H + 10^0 x I)] mod 7
= {(10^6) mod 7} x {(10^2 x A + 10^1 x B + 10^0 x C) (mod 7)} + {10^3 mod 7} x {(10^2 x D + 10^1 x E + 10^0 x F) mod 7} + {10^0 mod 7} x {(10^2 x G + 10^1 x H + 10^0 x I) mod 7 }
Now,
10^3 mod 7 = -1
10^6 mod 7 = (10^3 mod 7) x (10^3 mod 7) = -1 x -1 = 1
10^9 mod 7 = 10^6 mod 7 x 10^3 mod 7 = 1 x -1 = -1
Therefore,
(abcdefghi) mod 7 = (10^2 x A + 10^1 x B + 10^0 x C) mod 7 + (-1) x (10^2 x D + 10^1 x E + 10^0 x F) mod 7 + (10^2 x G + 10^1 x H + 10^0 x I) mod 7
In short, see if (ABC-DEF+GHI) is divisible by 7 or not
Similar for 13 and 1001 because 1000 mod 13 = -1 and 1000 mod 1001 = -1
Similarly, for any number that is of the form 10^k +/- 1. If the number is abcdef:
For 9 : f+e+d+c+b+a because 10 mod 9 =1
For 11: f-e+d-c+b-a or (f+d+b) – (e+c+a) ; because 10 mod 11 = -1
For 99: (ef + cd + ab) because 100 mod 99 =1 e.g. 2345 mod 99 = (23 + 45) mod 99 = 68
For 101: (ef – cd+ ab) because 100 mod 101 = -1 e.g. 2345 mod 101 = (45-23) mod 101 = 22
you may do this with any number of the form (a0a1a2a3...ai) base 10. Basically any number in decimal system. For other systems, similar concept can be used to find the remainder - will be a bit more complex though.
I see aliens...
Basic concepts used:
1.) Abcd = 10^3 x A + 10^2 x b + 10^1 x c + 10^0 x d
2.) (A x B) mod p = (A mod p) X (B mod p) e.g. (13 x 11) mod 4 = (13 mod 4) x (11 mod 4) = 1 x 3 = 3 (or 1 x -1= -1 [=3] )
3.) (A+B) mod p = (A mod p) + (B mod p) e.g. (13 + 11) mod 4 = 13 mod 4 + 11 mod 4 = 1+(-1) =0 (or 1+3 =4 [=0])
Divisibility for 3 and 9:
Adding all the digits and checking if the sum is divisible by 3 or 9 e.g. 234 mod 9 = (2+3+4) mod 9 = 0 hence divisible.
Proof:
Let the number be of the form ‘abcd’.
Abcd mod 9 = (10^3 x A + 10^2 x b + 10^1 x c + 10^0 x d) mod 9
= (10^3) mod 9 x A mod 9 + 10^2 mod 9 x B mod 9 + 10 mod 9 x c mod 9+ d mod 9
= (10 mod 9 )^3 x A mod 9 + (10 mod 9)^2 x B mod 9 + (10 mod 9) x c mod 9 + d mod 9
=1 x A mod 9+ 1 x B mod 9 + 1 x C mod 9 + d mod 9
= (A+b+c+d) mod 9
We were able to do this because we know 10 mod 9 = 1. Similarly if we know the relation between 10^k and m (where k and m are positive numbers) we can find the divisibility rule for (any number) mod m.
For 7:
1000 mod 7 = -1
Let any 9 digit number be: abcdefghi
Abcdefghi= 10^8 x A + 10^7 x B+ …… + 10^0 X i
= 10^6(10^2 x A + 10^1 x B + 10^0 x C) + 10^3 (10^2 x D + 10^1 x E + 10^0 x F) + 10^0 x (10^2 x G + 10^1 x H + 10^0 x I)
Now (abcdefghi) mod 7 =
[10^6(10^2 x A + 10^1 x B + 10^0 x C) + 10^3 (10^2 x D + 10^1 x E + 10^0 x F) + 10^0 x (10^2 x G + 10^1 x H + 10^0 x I)] mod 7
= {(10^6) mod 7} x {(10^2 x A + 10^1 x B + 10^0 x C) (mod 7)} + {10^3 mod 7} x {(10^2 x D + 10^1 x E + 10^0 x F) mod 7} + {10^0 mod 7} x {(10^2 x G + 10^1 x H + 10^0 x I) mod 7 }
Now,
10^3 mod 7 = -1
10^6 mod 7 = (10^3 mod 7) x (10^3 mod 7) = -1 x -1 = 1
10^9 mod 7 = 10^6 mod 7 x 10^3 mod 7 = 1 x -1 = -1
Therefore,
(abcdefghi) mod 7 = (10^2 x A + 10^1 x B + 10^0 x C) mod 7 + (-1) x (10^2 x D + 10^1 x E + 10^0 x F) mod 7 + (10^2 x G + 10^1 x H + 10^0 x I) mod 7
In short, see if (ABC-DEF+GHI) is divisible by 7 or not
Similar for 13 and 1001 because 1000 mod 13 = -1 and 1000 mod 1001 = -1
Similarly, for any number that is of the form 10^k +/- 1. If the number is abcdef:
For 9 : f+e+d+c+b+a because 10 mod 9 =1
For 11: f-e+d-c+b-a or (f+d+b) – (e+c+a) ; because 10 mod 11 = -1
For 99: (ef + cd + ab) because 100 mod 99 =1 e.g. 2345 mod 99 = (23 + 45) mod 99 = 68
For 101: (ef – cd+ ab) because 100 mod 101 = -1 e.g. 2345 mod 101 = (45-23) mod 101 = 22
you may do this with any number of the form (a0a1a2a3...ai) base 10. Basically any number in decimal system. For other systems, similar concept can be used to find the remainder - will be a bit more complex though.
I see aliens...
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.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
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.
Thank you for understanding, and happy exploring!
Updated on: 16 May 2013, 04:47
Originally posted by cyberjadugar on 15 May 2013, 23:41.
Last edited by cyberjadugar on 16 May 2013, 04:47, edited 1 time in total.
Last edited by cyberjadugar on 16 May 2013, 04:47, edited 1 time in total.
Kudos
Bookmarks
Hi,
Simplified (in terms of language)-
\(\frac {100a + 10b + c}3\)
100a+10b+c=99a+a+9b+b+c=(99a+9b)+(a+b+c)
(99a+9b) is divisible by 3, so, the number is divisible by 3 when a+b+c is divisible by 3 and that's sum of all digit in a number.
Regards,
Simplified (in terms of language)-
Divisibility rule for 3
\(\frac {100a + 10b + c}3\)
100a+10b+c=99a+a+9b+b+c=(99a+9b)+(a+b+c)
(99a+9b) is divisible by 3, so, the number is divisible by 3 when a+b+c is divisible by 3 and that's sum of all digit in a number.
Regards,
jumsumtak
Joined: 23 Mar 2011
Last visit: 14 Jun 2023
Posts: 1,092
Own Kudos:
Given Kudos: 479
Concentration: Healthcare, Strategy
Schools: Duke '16 (M)
16 May 2013, 03:04
Kudos
Bookmarks
cyberjadugar
Well, this is does not 'simplify' anything. If you look carefully, it is pretty much the same as what I wrote above.
Anyhow, the motive was not to present the simplest approach, but to provide a generic approach.
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.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
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.
Thank you for understanding, and happy exploring!
