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.
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:
We’ve worked incredibly hard to build TTP into the best test prep experience possible, and it would mean a lot to us to win Newsweek’s 2026 Readers’ Choice Award for Best Test Prep. If TTP has helped you, we’d be incredibly grateful for your vote.
Top scores are possible when you enroll in a powerful EA course, taught live online + 6 months access to TTP OnDemand video courses included! Perfect class schedule and easy course access for working professionals. Class starts Sept. 6, 9:30am-12:30pm EST
Meet AdComs and explore top Master’s programs - MiM, MiF, MSc, MSBA and more. - Application Fee Waivers - Free 1-Week of GMAT Club Tests: - Master's Application Toolkit - Grand Prize Giveaway
Elite scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thurs Sept. 15, 2026 - Nov. 15, 2027, 7:00pm-9:00pm EST
Elite scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thurs Oct. 13, 2026 - Jan. 7, 2027, 8:00pm-10:00pm EST
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.
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.
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
Show more
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!}\)
Can somebody please tell me where have i gone wrong?
Thanks, Anu
Show more
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.
A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.
This post was generated automatically.
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.
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.