|A) 1000||B) 100|
|C) 500||D) 999|
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 = 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 different initials = 1 million
i.e. (1 million = )
=> n = = 100
Hence, the language needs to have a minimum of 100 alphabets to achieve the objective.