GMAT Question of the Day: Daily via email | Daily via Instagram New to GMAT Club? Watch this Video

It is currently 07 Aug 2020, 01:28

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

Permutation and Combination Help

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Find Similar Topics 
Intern
Intern
avatar
Joined: 28 Feb 2011
Posts: 32
Permutation and Combination Help  [#permalink]

Show Tags

New post 22 Apr 2011, 09:14
Hi Guys,

I came across this problem in tutorvista site.

Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Find the number of words which have atleast one letter repeated.


I followed a different approach for solving and got a diiferent /wrong answer. Here's the appraoch that i followed.

Since 5 letters need to formed with atleast 1 word repeated, we have the following 3 cases:

CASE 1) xx123, where 1 word (XX) is repeated and 123 r the remaining 3 words

case 2) xxyy4, where 2 words r repeated (XX and YY) and 4 is the last word

CASE 3) xxxxx where all the word r repeated


CASE 1:

xx123

1st letter can be selected from 10 leeters in 10c1ways, since the second letter is repeated, there is only 1 way to do this. similarly , 3rd, 4th and 5th posotion can be filled in 9c1, 8c1 and 7c1 ways respectively.

so the total is : 10c1* 1* 9c1*8c1*7c1 ways ..further each of these words can be arranged in 5!/2! ways

So toatal is : 10c1* 1* 9c1*8c1*7c1 *5!/2! = 302400

CASE 2:

xxyy4

No of five letter words that can be formed = 10c1 *1 * 9c1 *1 *8c1 ways..furhter teses can be arranged in 5!/2!2! ways

So total number of 5 letters that can be formed, where two letters r repeated r = 10c1 *1 * 9c1 *1 *8c1 *5!/2!2! = 21600 ways

CASE 3)

xxxxx

10c1*1*1*1*1 ways . further this can be arraged in 1 ways only
So total number of 5 letter word that can be formed where alll leters r repeated is 10


TOTAL = CASE 1+CASE2+CASE3

302400 +21600+10

Can somebody please tell me where have i gone wrong?

Thanks,
Anu
Retired Moderator
avatar
Joined: 20 Dec 2010
Posts: 1462
Re: Permutation and Combination Help  [#permalink]

Show Tags

New post 22 Apr 2011, 09:25
1
anuu wrote:
Hi Guys,

I came across this problem in tutorvista site.

Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Find the number of words which have atleast one letter repeated.


I followed a different approach for solving and got a diiferent /wrong answer. Here's the appraoch that i followed.

Since 5 letters need to formed with atleast 1 word repeated, we have the following 3 cases:

CASE 1) xx123, where 1 word (XX) is repeated and 123 r the remaining 3 words

case 2) xxyy4, where 2 words r repeated (XX and YY) and 4 is the last word

CASE 3) xxxxx where all the word r repeated


CASE 1:

xx123

1st letter can be selected from 10 leeters in 10c1ways, since the second letter is repeated, there is only 1 way to do this. similarly , 3rd, 4th and 5th posotion can be filled in 9c1, 8c1 and 7c1 ways respectively.

so the total is : 10c1* 1* 9c1*8c1*7c1 ways ..further each of these words can be arranged in 5!/2! ways

So toatal is : 10c1* 1* 9c1*8c1*7c1 *5!/2! = 302400

CASE 2:

xxyy4

No of five letter words that can be formed = 10c1 *1 * 9c1 *1 *8c1 ways..furhter teses can be arranged in 5!/2!2! ways

So total number of 5 letters that can be formed, where two letters r repeated r = 10c1 *1 * 9c1 *1 *8c1 *5!/2!2! = 21600 ways

CASE 3)

xxxxx

10c1*1*1*1*1 ways . further this can be arraged in 1 ways only
So total number of 5 letter word that can be formed where alll leters r repeated is 10


TOTAL = CASE 1+CASE2+CASE3

302400 +21600+10

Can somebody please tell me where have i gone wrong?

Thanks,
Anu


It's sometimes easy to solve it using another approach;

Total words that can be formed with repetition: \((10)^5\)

Total words with no repetition= \(P^{10}_{5}=\frac{10!}{5!}\)

Total words with at least one repetition \((10)^5 - \frac{10!}{5!}\)
Veritas Prep GMAT Instructor
User avatar
V
Joined: 16 Oct 2010
Posts: 10793
Location: Pune, India
Re: Permutation and Combination Help  [#permalink]

Show Tags

New post 22 Apr 2011, 14:13
anuu wrote:

Can somebody please tell me where have i gone wrong?

Thanks,
Anu


What about 'xxx12' or 'xxxyy' or 'xxxx1'? (I am assuming x and y are different)
The 'atleast 1' questions are easier if done using the method shown by fluke.
_________________
Karishma
Veritas Prep GMAT Instructor

Learn more about how Veritas Prep can help you achieve a great GMAT score by checking out their GMAT Prep Options >
Non-Human User
User avatar
Joined: 09 Sep 2013
Posts: 15625
Re: Permutation and Combination Help  [#permalink]

Show Tags

New post 09 May 2017, 18:12
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: Permutation and Combination Help   [#permalink] 09 May 2017, 18:12

Permutation and Combination Help

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  





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