Last visit was: 24 Apr 2024, 11:34 It is currently 24 Apr 2024, 11:34

Close
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

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.
Close
Request Expert Reply
Confirm Cancel
SORT BY:
Date
Tags:
Show Tags
Hide Tags
Math Expert
Joined: 02 Sep 2009
Posts: 92902
Own Kudos [?]: 618788 [32]
Given Kudos: 81588
Send PM
RC & DI Moderator
Joined: 02 Aug 2009
Status:Math and DI Expert
Posts: 11169
Own Kudos [?]: 31889 [2]
Given Kudos: 290
Send PM
Manager
Manager
Joined: 24 Sep 2019
Posts: 128
Own Kudos [?]: 91 [1]
Given Kudos: 171
Location: India
GMAT 1: 710 Q49 V36
Send PM
GMAT Club Legend
GMAT Club Legend
Joined: 08 Jul 2010
Status:GMAT/GRE Tutor l Admission Consultant l On-Demand Course creator
Posts: 5957
Own Kudos [?]: 13387 [1]
Given Kudos: 124
Location: India
GMAT: QUANT+DI EXPERT
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
WE:Education (Education)
Send PM
How many different positive integers can be formed using each digit in [#permalink]
1
Kudos
Expert Reply
TarPhi wrote:
chetan2u wrote:
Bunuel wrote:
How many different positive integers can be formed using each digit in the set {0, 1, 3, 3, 3, 7, 8} exactly once?

A. 160
B. 720
C. 1440
D. 4320
E. 5040


Are You Up For the Challenge: 700 Level Questions



There are 7 digits out of which there are three 3s.
Different ways these can be arranged is 7!/3!, as three 3s can be arranged in 3! Ways we divided total by 3!
7!/3!=7*6*5*4=840.
However 840 is not in choices, and we have to use each digit once. But the numbers starting with 0 actually do not use 0 for example 0133378 is same as 133378, but without digit 0. Thus the question means 7-digit positive integers, and in this case we have to remove numbers starting with 0.
If first digit is 0, the remaining 6 can be arranged in 6!/3!=6*5*4=120
Total =840-110=720

OTHER WAY
The first digit can be taken by any of the digits except 0, so 7-1=6 ways. The remaining 6 positions can be arranged in 6!ways. —-6*6!
But there are 3 similar digits so total ways =6*6!/3!=6*6*5*4=720


B


Bunuel chetan2u GMATinsight can you please tell me why we divide by 3!?
I've always been confused by this :/



Since we have three 3's and their arrangement with each other won't make any difference in outcome so we need to exclude the arrangements of those three 3's

Arrangement of those three 3's can be done in 3! ways which is unnecessarily included (in multiplication form) in 6!, so we exclude the effect of those not-required arrangements of three 3's by dividing 6! by 3!

i.e. Arrangements of six digits {1, 3, 3, 3, 7, 8} = 6!/3!

Similarly, Arrangements of letters of word OHIO = 4!/2!

Similarly, Arrangements of letters of word MISSISSIPPI = 11!/(4!*4!*2!)



I hope this helps!
TarPhi
Manager
Manager
Joined: 24 Sep 2019
Posts: 128
Own Kudos [?]: 91 [1]
Given Kudos: 171
Location: India
GMAT 1: 710 Q49 V36
Send PM
Re: How many different positive integers can be formed using each digit in [#permalink]
1
Kudos
Fantastic explanation GMATinsight.

I sort of figured it out, but the examples definitely helped me solidify this!

Cheers!!
Director
Director
Joined: 21 Feb 2017
Posts: 521
Own Kudos [?]: 1034 [0]
Given Kudos: 1091
Location: India
GMAT 1: 700 Q47 V39
Send PM
Re: How many different positive integers can be formed using each digit in [#permalink]
chetan2u wrote:
Bunuel wrote:
How many different positive integers can be formed using each digit in the set {0, 1, 3, 3, 3, 7, 8} exactly once?

A. 160
B. 720
C. 1440
D. 4320
E. 5040


Are You Up For the Challenge: 700 Level Questions



There are 7 digits out of which there are three 3s.
Different ways these can be arranged is 7!/3!, as three 3s can be arranged in 3! Ways we divided total by 3!
7!/3!=7*6*5*4=840.
However 840 is not in choices, and we have to use each digit once. But the numbers starting with 0 actually do not use 0 for example 0133378 is same as 133378, but without digit 0. Thus the question means 7-digit positive integers, and in this case we have to remove numbers starting with 0.
If first digit is 0, the remaining 6 can be arranged in 6!/3!=6*5*4=120
Total =840-110=720

OTHER WAY
The first digit can be taken by any of the digits except 0, so 7-1=6 ways. The remaining 6 positions can be arranged in 6!ways. —-6*6!
But there are 3 similar digits so total ways =6*6!/3!=6*6*5*4=720


B


hi chetan2u in the explanation for the other way, I have a small query. we first take 6 for all nos without 0 and then we multiply this by 6!/3! to account for the remaining 6 digits and the three threes. but what if the first digit we chose would've been a three? then we would only need to divide by 2! and not 3!?
RC & DI Moderator
Joined: 02 Aug 2009
Status:Math and DI Expert
Posts: 11169
Own Kudos [?]: 31889 [1]
Given Kudos: 290
Send PM
Re: How many different positive integers can be formed using each digit in [#permalink]
Expert Reply
Kritisood wrote:
chetan2u wrote:
Bunuel wrote:
How many different positive integers can be formed using each digit in the set {0, 1, 3, 3, 3, 7, 8} exactly once?

A. 160
B. 720
C. 1440
D. 4320
E. 5040


Are You Up For the Challenge: 700 Level Questions



There are 7 digits out of which there are three 3s.
Different ways these can be arranged is 7!/3!, as three 3s can be arranged in 3! Ways we divided total by 3!
7!/3!=7*6*5*4=840.
However 840 is not in choices, and we have to use each digit once. But the numbers starting with 0 actually do not use 0 for example 0133378 is same as 133378, but without digit 0. Thus the question means 7-digit positive integers, and in this case we have to remove numbers starting with 0.
If first digit is 0, the remaining 6 can be arranged in 6!/3!=6*5*4=120
Total =840-110=720

OTHER WAY
The first digit can be taken by any of the digits except 0, so 7-1=6 ways. The remaining 6 positions can be arranged in 6!ways. —-6*6!
But there are 3 similar digits so total ways =6*6!/3!=6*6*5*4=720


B


hi chetan2u in the explanation for the other way, I have a small query. we first take 6 for all nos without 0 and then we multiply this by 6!/3! to account for the remaining 6 digits and the three threes. but what if the first digit we chose would've been a three? then we would only need to divide by 2! and not 3!?


Hi we find total ways and these are 6*6! if all were different.
But since three 3s are same, we divide total ways by 3!...6*6!/3!

Don’t confuse it as 6*(6!/3!), it is (6*6!)/3!
Manager
Manager
Joined: 25 May 2020
Posts: 135
Own Kudos [?]: 46 [0]
Given Kudos: 40
Send PM
Re: How many different positive integers can be formed using each digit in [#permalink]
The largest possible integer is a 6 digit one, hence 6!
Senior Manager
Senior Manager
Joined: 18 Sep 2018
Posts: 256
Own Kudos [?]: 200 [2]
Given Kudos: 322
Location: India
Concentration: Finance, International Business
GMAT 1: 690 Q49 V36
GPA: 3.72
WE:Investment Banking (Investment Banking)
Send PM
Re: How many different positive integers can be formed using each digit in [#permalink]
1
Kudos
1
Bookmarks
Arrangements problem.
IMO 720

Posted from my mobile device
Attachments

IMG_20200804_214705__01.jpg
IMG_20200804_214705__01.jpg [ 768.3 KiB | Viewed 6978 times ]

Intern
Intern
Joined: 27 Aug 2017
Posts: 32
Own Kudos [?]: 56 [0]
Given Kudos: 110
Location: India
GRE 1: Q167 V160
Send PM
How many different positive integers can be formed using each digit in [#permalink]
chetan2u: I'm not sure if I understand this problem correctly!

If an integer can be used only once, my understanding was that we essentially need to find out number of positive integers that can be formed using {0,1,3,7,8}

Calculating all possible integers and subtracting those starting with zero, we get:

1 digit integers = 4
2 digit integers = 5P2 - 4 = 16
3 digit integers = 5P3 - 4P2 = 48
4 digit integers = 5P4-4P3 = 96
5 digit integers = 5! - 4! = 96

Total possible integers by using each digit only once = 260

Where am I going wrong in my approach?
RC & DI Moderator
Joined: 02 Aug 2009
Status:Math and DI Expert
Posts: 11169
Own Kudos [?]: 31889 [1]
Given Kudos: 290
Send PM
Re: How many different positive integers can be formed using each digit in [#permalink]
1
Kudos
Expert Reply
EP2620 wrote:
chetan2u: I'm not sure if I understand this problem correctly!

If an integer can be used only once, my understanding was that we essentially need to find out number of positive integers that can be formed using {0,1,3,7,8}

Calculating all possible integers and subtracting those starting with zero, we get:

1 digit integers = 4
2 digit integers = 5P2 - 4 = 16
3 digit integers = 5P3 - 4P2 = 48
4 digit integers = 5P4-4P3 = 96
5 digit integers = 5! - 4! = 96

Total possible integers by using each digit only once = 260

Where am I going wrong in my approach?



Hi,
It doesn’t tell us that digits are different, but it tells us that we have to use EACH digit in the set, so if 3 is given three times, we will have to use digit 3 three times.
Intern
Intern
Joined: 27 Aug 2017
Posts: 32
Own Kudos [?]: 56 [0]
Given Kudos: 110
Location: India
GRE 1: Q167 V160
Send PM
Re: How many different positive integers can be formed using each digit in [#permalink]
chetan2u wrote:
EP2620 wrote:
chetan2u: I'm not sure if I understand this problem correctly!

If an integer can be used only once, my understanding was that we essentially need to find out number of positive integers that can be formed using {0,1,3,7,8}

Calculating all possible integers and subtracting those starting with zero, we get:

1 digit integers = 4
2 digit integers = 5P2 - 4 = 16
3 digit integers = 5P3 - 4P2 = 48
4 digit integers = 5P4-4P3 = 96
5 digit integers = 5! - 4! = 96

Total possible integers by using each digit only once = 260

Where am I going wrong in my approach?



Hi,
It doesn’t tell us that digits are different, but it tells us that we have to use EACH digit in the set, so if 3 is given three times, we will have to use digit 3 three times.




Ah yes I misinterpreted the question stem! Thanks for the prompt reply chetan2u!
Re: How many different positive integers can be formed using each digit in [#permalink]
I got the answer but I did it differently..don't know if my interpretation is right ..
If we group all 3 then there will be five digits in the number .this can be arranged in 5! Ways . Now the 3 threes can be arranged in 3! Ways .
Combining these we get 5!*3! Which is 720

Posted from my mobile device
User avatar
Non-Human User
Joined: 09 Sep 2013
Posts: 32650
Own Kudos [?]: 821 [0]
Given Kudos: 0
Send PM
Re: How many different positive integers can be formed using each digit in [#permalink]
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
GMAT Club Bot
Re: How many different positive integers can be formed using each digit in [#permalink]
Moderators:
Math Expert
92902 posts
Senior Moderator - Masters Forum
3137 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne