This GMAT quant practice question is a classic permutation question. Concept tested: Reordering 'n' distinct elements. A GMAT 600 level, easy problem solving sample question.
Question 8: In how many ways can the letters of the word "PROBLEM" be rearranged to make 7 letter words such that none of the letters repeat?
The letters of the word PROBLEM are distinct.
There are seven positions to be filled to form 7 letter words using the letters in the word PROBLEM.
The first position can be filled using any of the 7 letters contained in PROBLEM.
The second position can be filled by the remaining 6 letters as the letters should not repeat.
The third position can be filled by the remaining 5 letters and so on.
Therefore, the total number of ways of forming 7 letter words
= 7 × 6 × 5 × 4 × 3 × 2 × 1 = 7! ways.
Register in 2 easy steps and
Start learning in 5 minutes!
Next Batch April 9, 2023
GMAT Questionbank | Number Properties
GMAT Math Questions | Inequalities
GMAT Math Questions | Set Theory
GMAT Questions | Ratio, Percent, Fractions
GMAT Sample Questions | Rates - Work, Speed
GMAT Questions | Permutation & Probability
GMAT Sample Questions | Geometry
Copyrights © 2016 - 23 All Rights Reserved by Wizako.com - An Ascent Education Initiative.
GMAT® is a registered trademark of the Graduate Management Admission Council (GMAC). This website is not endorsed or approved by GMAC.
GRE® is a registered trademarks of Educational Testing Service (ETS). This website is not endorsed or approved by ETS.
SAT® is a registered trademark of the College Board, which was not involved in the production of, and does not endorse this product.
Wizako - GMAT, GRE, SAT Prep
An Ascent Education Initiative
14B/1 Dr Thirumurthy Nagar 1st Street
Chennai 600 034. India
Mobile: (91) 95000 48484
WhatsApp: WhatsApp Now
Leave A Message
TANCET Previous Year Question Papers
NCERT Solution for Class 10 Maths
CBSE Sample Papers for class 10