CAT 2016 sample practice question bank Permutation, combination : Ascent Education CAT XAT course material
 LATEST NEWS • Ascent Success Stories • TANCET 16 Classes @ Chennai • XAT 16 Classes @ Chennai
 Ascent's Courses CAT 2010 for IIMs CAT Classroom Chennai Math & DI Crash Course CAT - Correspondence CAT Correspondence India CAT Corres Abroad Mock CAT Series CAT Crash Course Math Shortcut Workshops XAT Classes TANCET 2010 Classes MAT Classes GRE-GMAT GMAT Classes US B Schools Faculty List Question A Day Business Partnership Jobs @ Ascent Testimonials Ascent TANCET Toppers

### Permutation and Combination - Quant/Math - CAT 2016

Question 4 the day: July 17, 2002

The question for the day is from the topic permutation and combination. Permutation and Combination is one area which if you are reasonably comfortable, you will be able to answer questions in minimum time.

Question:
How many alphabets need to be there in a language if one were to make 1 million distinct 3 digit initials using the alphabets of the language?

(1) 26
(2) 50
(3) 100
(4) 1000
Correct Answer - (3)

Solution:

1 million distinct 3 digit initials are needed.

Let the number of required alphabets in the language be ‘n’.

Therefore, using ‘n’ alphabets we can form n * n * n = n3 distinct 3 digit initials.

Note distinct initials is different from initials where the digits are different.
For instance, AAA and BBB are acceptable combinations in the case of distinct initials while they are not permitted when the digits of the initials need to be different.

This n3 different initials = 1 million

i.e. n3 = 106 (1 million = 106)
=> n3 = (102)3 => n = 102 = 100

Hence, the language needs to have a minimum of 100 alphabets to achieve the objective.

## XLRI XAT TANCET Practice Question Samples

#### Question Archives

 CAT GDPI Course

Staying outside India?
 Ascent offers CAT Correspondence Course for those who reside abroad.

 CAT Corres Online Regn

 GMAT Math Lesson Book | SAT prep | GRE Classes @ Chennai | GMAT Coaching @ Chennai | TANCET Mailing List © 2002 - 17 ASCENT Education all rights reserved. Terms & Condition | Privacy Policy