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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

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:

How many four-digit numbers one can arrange using all the [#permalink]
28 Jul 2003, 11:16

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

How many four-digit numbers one can arrange using all the digits, such that each number consists of two pairs of different digits. For example, 3377, 4545, or 1221.

First digit can be any of 1 thru 9 = 9 ways
Second digit should be same as 1st digit = 1 way
Third digit can be any one of 0 thru 9 (except the digit used for 1st posn ) = 9 ways
4th digit is to be same as 3rd digit = 1

So total ways : 9 x 1 x 9 x 1 = 81
but 3rd and 4th digits may change their positionas

First digit can be any of 1 thru 9 = 9 ways Second digit should be same as 1st digit = 1 way Third digit can be any one of 0 thru 9 (except the digit used for 1st posn ) = 9 ways 4th digit is to be same as 3rd digit = 1

So total ways : 9 x 1 x 9 x 1 = 81 but 3rd and 4th digits may change their positionas

So total numbers = 2 x 81 = 162

You are close but the 2nd digit does not necessarily have to match the first one. _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

Not quite. Much closer. Rethink your approach carefully. _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

510.
My approach
Let's count all possible combinations, including those that begin with 0.
There are 6 ways to arrange a number, f.e. 3377, 3737, 3773, 7733, 7373, 7337.
And there are 10*1*9*1=90 ways to combine such number from digits.
Final step is to subtract numbers, beginning with 0
1*10*1*1*3=30
The ans is 6*90-30=510

510. My approach Let's count all possible combinations, including those that begin with 0. There are 6 ways to arrange a number, f.e. 3377, 3737, 3773, 7733, 7373, 7337. And there are 10*1*9*1=90 ways to combine such number from digits. Final step is to subtract numbers, beginning with 0 1*10*1*1*3=30 The ans is 6*90-30=510

Quote:

>>And there are 10*1*9*1=90 ways to combine such number from digits. Final step is to subtract numbers, beginning with 0

You are double counting a few numbers here (for example, this method counts both 9 and 5, and 5 and 9, but they are the same because you already consider all combinations of 55 and 99.

Quote:

Final step is to subtract numbers, beginning with 0 1*10*1*1*3=30

Your final step is correct, but you are using wrong approach and calculation. _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

Method 1:
We have 2 different digits in each number. Let's call them A and B. Let's say we don't care about what order A and B are, so there are 10 * 9 / 2 = 45 difference pairings of A and B.

Now, let figure out how many way AA and BB can be put together. We have 4 digits, so there are 4! ways to arrange the four numbers, but the As and Bs are indistiguishable from each other so we need to adjust this by 2! twice. Hence, for a specific A and B the number of ways AABB can be combined is 4!/(2!2!) = (4*3)/(2*1) = 6.

So now we have 45 * 6 = 270 ways that AABB can be combined.

However, we cannot have 0 as a first digit. Since 0 is distributed the same as any of the other nine digits, exactly 10% of the numbers will start with zero and 90% will not. Hence the answer is 270 * .9 = 243.

Method 2:
There are 9 ways to pick the first number (excluding zero). Let's call this number A. For any given A, there are 9 ways to pick the other number B. So there are 81 ways to pick A as the first number and B as the other number. IF we set A to be the first digit, then there are 3 ways that the other 3 can be arranged: A-ABB, A-BAB, or A-BBA. Hence, there are 81 * 3 = 243 ways to make a four digit number with 2 paired numbers.

COMBINATORICS IS NOT ABOUT MEMORIZING FORMULAS, IT IS ABOUT COUNTING LOGICALLY AND SYSTEMATICALLY. _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

the first position -- 9 ways any of the three left -- the same digit -- 1 way the two left -- 9*1 ways

You are double counting here. Say you get a 3 first, then a 5 second. It is still posible to get a 5 first and a 3 second, but they are both counted when you did the 4C2 calculation.

Even so, your method is still sloppy, since by using the 4C2 formula, you mix number that CAN be zero, with numbers that cannot be zero.

While you might back in to the correct answer, your solution in not good.

Sorry bro. _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

First digit can be any of 1 thru 9 = 9 ways Second digit should be same as 1st digit = 1 way Third digit can be any one of 0 thru 9 (except the digit used for 1st posn ) = 9 ways 4th digit is to be same as 3rd digit = 1

So total ways : 9 x 1 x 9 x 1 = 81 but 3rd and 4th digits may change their positionas

So total numbers = 2 x 81 = 162

You are close but the 2nd digit does not necessarily have to match the first one.

I should have multiplied by 3 to get total numbers. Thanks anyway . _________________