n-digit numbers are formed using only three digits 2, 5 and 7. The smallest value of n for which 900 such distinct numbers can be formed, is:
We are asked to build n-digit numbers using only the three digits 2, 5 and 7. Because none of these digits is zero, any string of length n made from them will automatically be an n-digit positive integer, even when the first position is filled. Thus every position in the number (units, tens, hundreds, …, up to the n-th place) can be occupied independently by any of the three choices 2, 5 or 7.
We now state the basic counting principle: if a first task can be done in ways and, independently, a second task can be done in ways, then the two tasks together can be done in ways. Extending this idea, if each of n independent positions can be filled in ways, the total number of ways is .
Here (the digits 2, 5, 7) and we have n independent positions, so the total number of distinct n-digit numbers that can be formed is
Our goal is to find the smallest n for which at least 900 such numbers exist. Symbolically we require
Instead of logarithms, we can test successive powers of 3 until we exceed 900, showing every step:
For we have which is less than 900.
For we have still less than 900.
For we have which is greater than 900.
Thus while The inequality is satisfied for the first time at .
Therefore, the smallest value of n that allows the formation of at least 900 distinct numbers is .
Hence, the correct answer is Option D.
Tagged Fundamental principle of counting. Machine-assigned, so read it as a strong shortlist rather than a verdict.