Question
ndigit 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 :
Options
Solution
Key Concepts and Formulas
- Fundamental Principle of Counting (Multiplication Rule): If there are ways to do one thing and ways to do another, then there are ways to do both. This extends to any number of independent events.
- -digit numbers with repetition: If we are forming -digit numbers using distinct digits, and repetition is allowed, then the total number of distinct numbers that can be formed is .
- Inequalities: Understanding how to set up and solve inequalities to find the minimum or maximum value that satisfies a given condition.
Step-by-Step Solution
Step 1: Identify the parameters and the goal.
We are given that we need to form -digit numbers using only the digits 2, 5, and 7. This means we have 3 choices for each digit. Repetition is allowed. Our goal is to find the smallest value of such that we can form at least 900 distinct numbers.
Step 2: Determine the number of -digit numbers that can be formed.
Since we have 3 choices for each of the digits, and repetition is allowed, the total number of -digit numbers that can be formed is . This follows directly from the Fundamental Principle of Counting.
Step 3: Set up the inequality.
We want to find the smallest such that the number of distinct numbers formed is greater than or equal to 900. This translates to the inequality:
Step 4: Solve the inequality by testing integer values of n.
We need to find the smallest integer that satisfies the inequality. We test increasing values of :
- For : . Since , is not a solution.
- For : . Since , is not a solution.
- For : . Since , is not a solution.
- For : . Since , is not a solution.
- For : . Since , is not a solution.
- For : . Since , is not a solution.
- For : . Since , is a solution.
Since is too small, and is the next smallest integer, is the smallest integer that satisfies the inequality.
Common Mistakes & Tips
- Forgetting Repetition: Failing to recognize that repetition is allowed would lead to a completely different (and incorrect) approach.
- Incorrect Inequality: Setting up the inequality as would be incorrect since we are looking for the smallest for which at least 900 numbers can be formed.
- Miscalculation: Errors in calculating the powers of 3 could lead to selecting the wrong value of .
Summary
The problem involves finding the smallest number of digits, , such that at least 900 distinct numbers can be formed using the digits 2, 5, and 7 with repetition allowed. This is solved by recognizing that the number of distinct -digit numbers is , setting up the inequality , and testing integer values of until the inequality is satisfied. The smallest integer value of that satisfies the condition is .
The final answer is , which corresponds to option (B).