Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Jun 1006:00 AM PDT
-06:15 PM PDT
Register for the GMAT Club Virtual MBA Spotlight Fair – the world’s premier event for serious MBA candidates. This is your chance to hear directly from Admissions Directors at nearly every Top 30 MBA program..- Jun 10
10:00 AM PDT
-11:00 AM PDT
Scoring 715 on the GMAT Focus Edition requires more than just learning formulas, memorizing concepts, or solving hundreds of questions. In this episode, Nishant shares how he improved his GMAT preparation by focusing on application of concepts, and more. 
Jun 1111:00 AM EDT
-01:00 PM EDT
TTP GMAT OnDemand gives serious students 400+ hours of expert video instruction, the full TTP course, AI support, weekly office hours, and a 715+ score guarantee—all built for elite GMAT score improvement.
Jun 2207:30 PM EDT
-09:30 PM EDT
Master the GMAT with expert live instruction, a personalized study plan, and real-time support. Includes 40 hours of online classes plus 6 months of access to the TTP GMAT OnDemand video course. Class date: Mon/Wed June 22, 2026 →August 26, 2026
22 Apr 2011, 10:14
Kudos
Bookmarks
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
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
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
22 Apr 2011, 10:25
Kudos
Bookmarks
anuu
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!}\)
22 Apr 2011, 15:13
Kudos
Bookmarks
anuu
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.
