Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Step 1: There are three choices for each digit position, so the number of distinct n-digit strings is $3^n$. All allowed digits are nonzero, so every string is an n-digit number.
Step 2: For $n=6$, the count is $3^6=729<900$, while for $n=7$ it is $3^7=2187\ge900$.
Step 3: Therefore the smallest admissible value is $n=7$, option 2.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.