BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

permutation, combination

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Source: — Problem Solving |

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 2623
Joined: Mon Jun 02, 2008 3:17 amFollowed by: 355 members
Location: Montreal
Thanked: 1090 times
GMAT Score:780

Re: permutation, combination

by Ian Stewart » Wed Jul 09, 2008 4:48 am
umaa wrote:How many 5 digit numbers can be formed which are divisible by 3 using the numerals 0,1,2,3,4,5 (WITHOUT REPETITION)
If a number is divisible by 3, the sum of its digits is divisible by 3. We need to choose five digits from {0,1,2,3,4,5} which add to a multiple of 3. We could choose:

{1, 2, 3, 4, 5}

or

{0, 1, 2, 4, 5}

If we use the digits {1, 2, 3, 4, 5}, we have 5 choices for the first digit, 4 for the second, etc- 5! = 120 numbers we can make in total.

If we use the digits {0, 1, 2, 4, 5}, we only have 4 choices for the first digit (because it cannot be zero), 4 choices for the second digit, 3 for the third, etc- 4*4! = 96 numbers we can make in total.

120+96 = 216.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com

ianstewartgmat.com
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 727
Joined: Sun Jun 08, 2008 9:32 pmFollowed by: 1 member
Thanked: 8 times

by umaa » Wed Jul 09, 2008 5:04 am
Thanks :)
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Senior | Next Rank: 100 Posts
Posts: 95
Joined: Sun Jul 06, 2008 6:41 am
Location: INDIA
Thanked: 2 times

by preetha_85 » Wed Jul 09, 2008 5:35 am
Hi ,

for a no. to be divisible by 3 the nos should add up to a multiple of 3.
Given the digits (0,1,2,3,4,5)
Only the combinations given below will add up to a multiple of 3 :
1. (1,2,3,4,5)
2. (0,1,2,4,5)

Case 1:
these nos can be arranged in 5! ways i.e 120

Case 2:
Since if 0 is the 1st digit it will not form a 5 digit no. they can be arranged in :4*4*3*2*1

hence the total permutations is :120 +96 =216
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Senior | Next Rank: 100 Posts
Posts: 95
Joined: Sun Jul 06, 2008 6:41 am
Location: INDIA
Thanked: 2 times

by preetha_85 » Wed Jul 09, 2008 5:35 am
Hi ,

for a no. to be divisible by 3 the nos should add up to a multiple of 3.
Given the digits (0,1,2,3,4,5)
Only the combinations given below will add up to a multiple of 3 :
1. (1,2,3,4,5)
2. (0,1,2,4,5)

Case 1:
these nos can be arranged in 5! ways i.e 120

Case 2:
Since if 0 is the 1st digit it will not form a 5 digit no. they can be arranged in :4*4*3*2*1

hence the total permutations is :120 +96 =216
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Senior | Next Rank: 100 Posts
Posts: 52
Joined: Tue Jul 01, 2008 10:50 am

Interesting

by evansbd » Thu Jul 17, 2008 7:47 am
I noticed most people solved this problem exactly the same way.

I did the last part a little different.

Case 1: 5! = 120 - this is the easy part

Case 2:

I kind of understand why people will do 4*4!. However if I were on the exam I probably would not have realized I needed to multiply by four.

Personally, I saw that 0 couldn't be the first number for a 0 1 2 4 5 combination. I could see that I needed to find the number of combinations then subtract the ones that didnt fit the criteria of being divisible by 3. So I said there are 5! combinations of 0 1 2 4 5. However we must subtract the number of combinations where 0 is the first number.

total combinations - 0 first combinations = 5! - 4! = 120 - 24 = 96

Then I added 120 + 96 = 216
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Newbie | Next Rank: 10 Posts
Posts: 1
Joined: Tue Aug 02, 2011 11:09 am

by joschgmat » Tue Aug 02, 2011 11:18 am
Ian Stewart wrote:
umaa wrote:How many 5 digit numbers can be formed which are divisible by 3 using the numerals 0,1,2,3,4,5 (WITHOUT REPETITION)
If a number is divisible by 3, the sum of its digits is divisible by 3. We need to choose five digits from {0,1,2,3,4,5} which add to a multiple of 3. We could choose:

{1, 2, 3, 4, 5}

or

{0, 1, 2, 4, 5}

If we use the digits {1, 2, 3, 4, 5}, we have 5 choices for the first digit, 4 for the second, etc- 5! = 120 numbers we can make in total.

If we use the digits {0, 1, 2, 4, 5}, we only have 4 choices for the first digit (because it cannot be zero), 4 choices for the second digit, 3 for the third, etc- 4*4! = 96 numbers we can make in total.

120+96 = 216.
but a number like 10234 is not divisible by 3, the omission of any of the digits 1,2,4,5 while including 0 will be a number thats not divisible by 3.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1