|
Author |
Message |
|
TAGS:
|
|
|
Manager
Joined: 29 May 2008
Posts: 119
Followers: 1
Kudos [?]:
5
[0], given: 0
|
How many five-digit numbers can be formed using digits [#permalink]
22 Oct 2009, 14:20
Question Stats:
52% (02:18) correct
47% (02:37) wrong based on 0 sessions
How many five digit numbers can be formed using digits 0,1,2,3,4,5, Which are divisible by 3, whithout any of the digits repeating? A. 15 B. 96 C. 120 D. 181 E. 216
|
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11518
Followers: 1792
Kudos [?]:
9538
[6] , given: 826
|
Re: digit counting [#permalink]
22 Oct 2009, 14:59
6
This post received KUDOS
TheRob wrote: How many five digit numbers can be formed using digits 0,1,2,3,4,5, Which are divisible by 3, whithout any of the digits repeating?
A. 15 B. 96 C. 120 D. 181 E. 216 First step:We should determine which 5 digits from given 6, would form the 5 digit number divisible by 3. We have six digits: 0,1,2,3,4,5. Their sum=15. For a number to be divisible by 3 the sum of the digits must be divisible by 3. As the sum of the six given numbers is 15 (divisible by 3) only 5 digits good to form our 5 digit number would be 15-0={1, 2, 3, 4, 5} and 15-3={0, 1, 2, 4, 5}. Meaning that no other 5 from given six will total the number divisible by 3. Second step:We have two set of numbers: {1, 2, 3, 4, 5} and {0, 1, 2, 4, 5}. How many 5 digit numbers can be formed using this two sets: {1, 2, 3, 4, 5} --> 5! as any combination of these digits would give us 5 digit number divisible by 3. 5!=120. {0, 1, 2, 4, 5} --> here we can not use 0 as the first digit, otherwise number won't be any more 5 digit and become 4 digit. So, total combinations 5!, minus combinations with 0 as the first digit (combination of 4) 4! --> 5!-4!=96 120+96=216 Answer: E.
_________________
PLEASE READ AND FOLLOW: 11 Rules for Posting!!!
RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory
COLLECTION OF QUESTIONS: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!
 What are GMAT Club Tests? 25 extra-hard Quant Tests
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Senior Manager
Affiliations: PMP
Joined: 13 Oct 2009
Posts: 319
Followers: 2
Kudos [?]:
76
[0], given: 37
|
Re: digit counting [#permalink]
22 Oct 2009, 15:14
Thanks Bunuel for the great explanation . +1 Kudos... Why don't I borrow your math brain for my GMAT  LOL
_________________
Thanks, Sri ------------------------------- keep uppp...ing the tempo...
Press +1 Kudos, if you think my post gave u a tiny tip
|
|
|
|
|
|
Manager
Joined: 05 Jul 2009
Posts: 196
Followers: 1
Kudos [?]:
8
[0], given: 5
|
Re: digit counting [#permalink]
24 Oct 2009, 00:06
srini123 wrote: Thanks Bunuel for the great explanation . +1 Kudos... Why don't I borrow your math brain for my GMAT  LOL I have been thinking the same for quite some days!
|
|
|
|
|
|
Manager
Joined: 13 Oct 2009
Posts: 54
Location: New York, NY
Schools: Columbia, Johnson, Tuck, Stern
Followers: 1
Kudos [?]:
6
[0], given: 2
|
Re: digit counting [#permalink]
25 Oct 2009, 14:42
YOu're awesome Bunuel !!
|
|
|
|
|
|
Manager
Joined: 15 Sep 2009
Posts: 149
Followers: 1
Kudos [?]:
8
[0], given: 2
|
Re: digit counting [#permalink]
26 Oct 2009, 06:21
Only 2 sets are possible
case (1) 1,2,3,4,5 case (2) 0,1,2,4,5.
case (1) : there will 5! ways to form the number = 120
case (2) ; there will 4*4*3*2*1 = 96 ways
So total no.of ways = 120+96 = 216 ways
|
|
|
|
|
|
Senior Manager
Joined: 13 Dec 2009
Posts: 269
Followers: 8
Kudos [?]:
67
[0], given: 13
|
aramjung wrote: How many five-digit numbers can be formed using the digits 0, 1, 2, 3, 4 and 5 which are divisible by 3, without repeating the digits? (C) 2008 GMAT Club - m04#3215 96 120 181 216 HOW DO YOU SOLVE THIS, I CAN'T UNDERSTAND IT  For a number to be divisible by 3 sum of its digits should be divisible by 3, so in 0,1,2,3,4,5 set of digits that can be together 1,2,3,4,5, and 0,1,2,4,5 (drop one digit at a time and sum rest of the others to find this ) in first set numbers that can be there = 5*4*3*2*1 in second set = 4*4*3*2*1 (since zero cannot be the last digit) total = 5*4*3*2*1 + 4*4*3*2*1 = 4! * (5+4) = 24 * 9 = 216, hence 216 is the answer.
_________________
My debrief: done-and-dusted-730-q49-v40
|
|
|
|
|
|
Intern
Joined: 15 Feb 2010
Posts: 11
Followers: 0
Kudos [?]:
0
[0], given: 0
|
thank you sooo much!!!!!!!!
|
|
|
|
|
|
Director
Joined: 03 Sep 2006
Posts: 910
Followers: 5
Kudos [?]:
29
[0], given: 33
|
By the property of divisibility by 3 i.e "a no: is divisible by 3, if the sum of the digits is divisible by 3"(e.g= 12-->1+2=3)
so from 0,1,2,3,4,5 the set of 5 digit no:s that can be formed which is divisible by 3 are 0,1,2,4,5(sum=12) & 1,2,3,4,5(sum=15)
from first set(0,1,2,4,5) no:s formed are 96 i.e first digit can be formed from any 4 no: except 0, second digit from 4 no: except digit used at first place,3rd from rest 3 , 4th from rest 2 no: and in fifth remaining digit since no repetition allowed.
from second set(1,2,3,4,5) no:s formed are 120 i.e first digit can be formed from any 5 digits, second digit from 4 no: except digit used at first place,3rd from rest 3 , 4th from rest 2 no: and in fifth remaining digit since no repetition allowed.
so total 120+96=216
|
|
|
|
|
|
Senior Manager
Joined: 28 Aug 2010
Posts: 280
Followers: 3
Kudos [?]:
20
[0], given: 11
|
Re: digit counting [#permalink]
06 Feb 2011, 14:48
For a number to be divisible by 3 the sum of the digits must be divisible by 3. As the sum of the six given numbers is 15 (divisible by 3) only 5 digits good to form our 5 digit number would be 15-0={1, 2, 3, 4, 5} and 15-3={0, 1, 2, 4, 5}. Meaning that no other 5 from given six will total the number divisible by 3. i understood the first part but did not get the second part 15-3={0, 1, 2, 4, 5}. Meaning that no other 5 from given six will total the number divisible by 3. ..Could you please explain it in a little bit more detail. Thanks
_________________
Verbal:new-to-the-verbal-forum-please-read-this-first-77546.html Math: new-to-the-math-forum-please-read-this-first-77764.html Gmat: everything-you-need-to-prepare-for-the-gmat-revised-77983.html ------------------------------------------------------------------------------------------------- Ajit
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11518
Followers: 1792
Kudos [?]:
9538
[0], given: 826
|
Re: digit counting [#permalink]
06 Feb 2011, 14:55
ajit257 wrote: For a number to be divisible by 3 the sum of the digits must be divisible by 3. As the sum of the six given numbers is 15 (divisible by 3) only 5 digits good to form our 5 digit number would be 15-0={1, 2, 3, 4, 5} and 15-3={0, 1, 2, 4, 5}. Meaning that no other 5 from given six will total the number divisible by 3.
i understood the first part but did not get the second part 15-3={0, 1, 2, 4, 5}. Meaning that no other 5 from given six will total the number divisible by 3. ..Could you please explain it in a little bit more detail. Thanks The sum of the given digits is already a multiple of 3 (15), in order the sum of 5 digits to be a multiple of 3 you must withdraw a digit which is itself a multiple of 3, otherwise (multiple of 3) - (non-multiple of 3) = (non-multiple of 3).
_________________
PLEASE READ AND FOLLOW: 11 Rules for Posting!!!
RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory
COLLECTION OF QUESTIONS: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!
 What are GMAT Club Tests? 25 extra-hard Quant Tests
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Senior Manager
Joined: 28 Aug 2010
Posts: 280
Followers: 3
Kudos [?]:
20
[0], given: 11
|
Re: digit counting [#permalink]
06 Feb 2011, 14:59
so lets say we were asked a multiple of 5 so in that case we would have to withdraw the digit 5 ..is that correct ?
_________________
Verbal:new-to-the-verbal-forum-please-read-this-first-77546.html Math: new-to-the-math-forum-please-read-this-first-77764.html Gmat: everything-you-need-to-prepare-for-the-gmat-revised-77983.html ------------------------------------------------------------------------------------------------- Ajit
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11518
Followers: 1792
Kudos [?]:
9538
[0], given: 826
|
Re: digit counting [#permalink]
06 Feb 2011, 15:18
ajit257 wrote: so lets say we were asked a multiple of 5 so in that case we would have to withdraw the digit 5 ..is that correct ? 5 or 0, as 0 is also a multiple of 5. AGAIN: we have (sum of 6 digits)=(multiple of 3). Question what digit should we withdraw so that the sum of the remaining 5 digits remain a multiple of 3? Answer: the digit which is itself a multiple of 3. Below might help to understand this concept better. If integers a and b are both multiples of some integer k>1 (divisible by k), then their sum and difference will also be a multiple of k (divisible by k):Example: a=6 and b=9, both divisible by 3 ---> a+b=15 and a-b=-3, again both divisible by 3. If out of integers a and b one is a multiple of some integer k>1 and another is not, then their sum and difference will NOT be a multiple of k (divisible by k):Example: a=6, divisible by 3 and b=5, not divisible by 3 ---> a+b=11 and a-b=1, neither is divisible by 3. If integers a and b both are NOT multiples of some integer k>1 (divisible by k), then their sum and difference may or may not be a multiple of k (divisible by k):Example: a=5 and b=4, neither is divisible by 3 ---> a+b=9, is divisible by 3 and a-b=1, is not divisible by 3; OR: a=6 and b=3, neither is divisible by 5 ---> a+b=9 and a-b=3, neither is divisible by 5; OR: a=2 and b=2, neither is divisible by 4 ---> a+b=4 and a-b=0, both are divisible by 4. Hope it's clear.
_________________
PLEASE READ AND FOLLOW: 11 Rules for Posting!!!
RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory
COLLECTION OF QUESTIONS: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!
 What are GMAT Club Tests? 25 extra-hard Quant Tests
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Senior Manager
Joined: 28 Aug 2010
Posts: 280
Followers: 3
Kudos [?]:
20
[0], given: 11
|
Re: digit counting [#permalink]
06 Feb 2011, 15:20
Bunuel...awesome ..thanks a ton!
_________________
Verbal:new-to-the-verbal-forum-please-read-this-first-77546.html Math: new-to-the-math-forum-please-read-this-first-77764.html Gmat: everything-you-need-to-prepare-for-the-gmat-revised-77983.html ------------------------------------------------------------------------------------------------- Ajit
|
|
|
|
|
|
Math Forum Moderator
Joined: 20 Dec 2010
Posts: 2100
Followers: 108
Kudos [?]:
654
[1] , given: 376
|
Re: digit counting [#permalink]
07 Feb 2011, 04:39
1
This post received KUDOS
0,1,2,3,4,5 One digit will have to remain out for all 5 digit numbers; if 0 is out; Leftover digits will be 1,2,3,4,5 = Sum(1,2,3,4,5)=15. 5! = 120 numbers if 1 is out; Leftover digits will be 0,2,3,4,5 = Sum(0,2,3,4,5)=14. Ignore(Not divisible by 3) if 3 is out; Leftover digits will be 0,1,2,4,5 = Sum(0,1,2,4,5)=12. 4*4! = 4*24 = 96 if 4 is out; Leftover digits will be 0,1,2,3,5 = Sum(0,1,2,3,5)=11. Ignore if 5 is out; Leftover digits will be 0,1,2,3,4 = Sum(0,1,2,3,4)=10. Ignore Total count of numbers divisible by 3 = 120+96 = 216 Ans: "E"
_________________
~fluke
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Director
Joined: 28 Jul 2011
Posts: 596
Location: United States
Concentration: International Business, General Management
GPA: 3.86
WE: Accounting (Commercial Banking)
Followers: 1
Kudos [?]:
25
[0], given: 16
|
Can anyone please explain how to do these kind of problems in less than 2 min.......
Attachments

Numberproperties.jpg [ 70.56 KiB | Viewed 5579 times ]
_________________
+1 Kudos If found helpful..
|
|
|
|
|
|
Manager
Status: Meh, I can't take the GMAT before 2017.
Joined: 20 Aug 2011
Posts: 157
Followers: 3
Kudos [?]:
48
[2] , given: 0
|
Re: Number properties [#permalink]
06 Jan 2012, 07:48
2
This post received KUDOS
A number is divisible by 3 if sum of its digits is a multiple of 3. With the given set of digits, there are two possible combinations of 5 digits each- A. [1,2,3,4,5] No. of possible 5 digit numbers: 5!= 120 B. [0,1,2,4,5] No. of possible 5 digit numbers: 4*4!=96 [the number can't start with a 0] A+B= 120+96= 216 E
_________________
Hit kudos if my post helps you. You may send me a PM if you have any doubts about my solution or GMAT problems in general.
Last edited by blink005 on 06 Jan 2012, 09:27, edited 1 time in total.
|
|
|
|
|
|
Director
Joined: 28 Jul 2011
Posts: 596
Location: United States
Concentration: International Business, General Management
GPA: 3.86
WE: Accounting (Commercial Banking)
Followers: 1
Kudos [?]:
25
[0], given: 16
|
Re: Number properties [#permalink]
06 Jan 2012, 08:07
blink005 wrote: A number is divisible by 3 if sum of it's digits is a multiple of 3.
With the given set of digits, there are two possible combinations of 5 digits each-
A. [1,2,3,4,5] No. of possible 5 digit numbers: 5!= 120 B. [0,1,2,4,5] No. of possible 5 digit numbers: 4*4!=96 [the number can't start with a 0]
A+B= 120+96= 216
E simple........Offff i missed as Simple step.... thanks for the explanation... +1 Kudos for You
_________________
+1 Kudos If found helpful..
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11518
Followers: 1792
Kudos [?]:
9538
[0], given: 826
|
Re: Number properties [#permalink]
13 Jan 2012, 07:09
|
|
|
|
|
|
Manager
Joined: 15 Aug 2012
Posts: 50
Location: India
Concentration: Technology, Strategy
GPA: 3.6
WE: General Management (Computer Software)
Followers: 0
Kudos [?]:
7
[0], given: 5
|
How many five digit numbers can be formed using digits 0,1,2,3,4 [#permalink]
13 Nov 2012, 19:31
12345
and
01234
are the two set of numbers which are divisible by 3 when added.
12345->5.4.3.2.1 ways = 120 01234->4.4.3.2.1 ways = 96
Total 216
|
|
|
|
|
|
|
How many five digit numbers can be formed using digits 0,1,2,3,4
[#permalink]
13 Nov 2012, 19:31
|
|
|
|
|
|
|
|
|
|
|