Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 5: Problem 430

Nine hundred distinct n digit numbers are to be formed using only the 3 digits \(2,5,7 .\) The smallest value of \(\mathrm{n}\) for which this is possible is (a) 6 (b) 7 (c) 8 (d) 9

Short Answer

Expert verified
The smallest value of n for which it is possible to form 900 distinct n-digit numbers using only the digits 2, 5, and 7 is 7. This is determined by solving the inequality \(3^n \geq 900\), which simplifies to \(n \geq \log_3{(900)}\), where n is approximately 6.29. Since n must be an integer, the smallest integer greater than or equal to 6.29 is 7. Therefore, the correct answer is (b) 7.

Step by step solution

01

Determine the number of possible combinations

The number of possible n-digit numbers using these 3 digits can be thought of as a problem of arranging the 3 digits in n distinct positions. Using the counting principle, we have 3 choices for the first position, 3 choices for the second position, and so on until the nth position. So the total number of possible combinations is \(3^n\).
02

Set up an inequality

We want to find the smallest n such that at least 900 n-digit numbers can be formed, so we need to find the smallest n for which \(3^n \geq 900\).
03

Solve the inequality

To solve the inequality \(3^n \geq 900\), we can take the logarithm base 3 of both sides: \[\log_3{(3^n)} \geq \log_3{(900)}\] By the properties of logarithms, the left side simplifies to \(n\), giving us: \[n \geq \log_3{(900)}\]
04

Find the smallest integer n

Calculate the approximate value for the logarithm term: \[\log_3{(900)} \approx 6.29\] Since n must be an integer, we take the smallest integer greater than or equal to 6.29, which is 7.
05

Choose the correct option

The smallest value of n for which it is possible to form 900 distinct n-digit numbers is 7. So the correct answer is (b) 7.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Start your free trial

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Nandan gives dinner party to six guests. The number of ways in which they may be selected from ten friends if two of the friends will not attend the party together is: (a) 112 (b) 140 (c) 164 (d) 146

4 boys picked up 30 mangoes. In how many ways can they divide them, if all mangoes be identical (a) \({ }^{33} \mathrm{C}_{4}\) (b) \({ }^{33} \mathrm{C}_{2}\) (c) 5456 (d) 6554 .

How many words can be formed by taking four different letters of the word MATHEMATICS? (a) 756 (b) 1680 (c) 2454 (d) 18

If \(\mathrm{n}={ }^{\mathrm{m}} \mathrm{C}_{2}\) then \({ }^{\mathrm{n}} \mathrm{C}_{2}\) equal to. (a) \({ }^{\mathrm{m}+1} \mathrm{C}_{4}\) (b) \({ }^{\mathrm{m}-1} \mathrm{C}_{4}\) (c) \({ }^{\mathrm{m}+2} \mathrm{C}_{4}\) (d) None of these

In a certain test there are n questions. In this test \(2^{\mathrm{k}}\) students gave wrong answers to at least \((\mathrm{n}-\mathrm{k})\) question. \(\mathrm{k}=0,1,2 \ldots \mathrm{n} .\) If the no. of wrong answers is 4095 then value of \(\mathrm{n}\) is (a) 11 (b) 12 (c) 13 (d) 15
See all solutions

Recommended explanations on English Textbooks

Graphology

Read Explanation

Blog

Read Explanation

Sociolinguistics

Read Explanation

International English

Read Explanation

Research and Composition

Read Explanation

Language Analysis

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free