/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q. 1.8 Consider n-digit numbers where e... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Consider n-digit numbers where each digit is one of the 10integers 0,1,...,9. How many such numbers are there for which

(a) no two consecutive digits are equal?

(b) 0 appears as a digit a total of itimes, i=0,...,n?

Short Answer

Expert verified

(a) Total numbers for which no two consecutive digits are equal are 10×9n-1.

(b) Total numbers for which 0appears as a digit a total of itimes, i=0,...,nareni9n-i.

Step by step solution

01

Part (a) Step 1. Given information.

We have to form n-digit numbers where each digit is one of the 10integers 0,1,...,9and no two consecutive digits are equal.

02

Part (a) Step 2. Find the numbers for which no two consecutive digits are equal.

Total no. of digits =10

So, the first place can be filled in =10!ways=10

Each of the remaining n-1place can be filled in =9!ways=9as two consecutive digits cannot be equal.

Therefore, the total numbers for which no two consecutive digits are equal are10×9n-1.

03

Part (b) Step 1. Given information.

We have to form n-digit numbers where each digit is one of the 10integers 0,1,...,9and 0 appears as a digit a total of itimes, where i=0,...,n.

04

Part (b) Step 2. Find the numbers for which 0 appears as a digit a total of i times.

No. of choices of iplaces to put 0is =ni

The remaining n-iposition can be filled by any of the 9digits, 1,2,........,9.

Therefore, the total numbers for which 0 appears as a digit a total of i times,i=0,...,n=ni9n-i.

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.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

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

In how many ways can a man divide 7 gifts among his 3 children if the eldest is to receive 3 gifts and the others 2 each?

How many different linear arrangements are there of the letters A, B, C, D, E, F for which

(a) A and B are next to each other?

(b) A is before B?

(c) A is before B and B is before C?

(d) A is before B and C is before D?

(e) A and B are next to each other and C and D are also next to each other?

(f) E is not last in line?

Consider the following combinatorial identity:

∑k=1nknk=n·2n-1

(a) Present a combinatorial argument for this identity by considering a set of npeople and determining, in two ways,

the number of possible selections of a committee of any size and a chairperson for the committee.

Hint:

(i) How many possible selections are there of a committee of size kand its chairperson?

(ii) How many possible selections are there of a chairperson and the other committee members?

(b) Verify the following identity for n=1,2,3,4,5:

localid="1648098528048" ∑k=1nnkk2=2n-2n(n+1)

For a combinatorial proof of the preceding, consider a set of n people and argue that both sides of the identity represent

the number of different selections of a committee, its chairperson, and its secretary (possibly the same as the chairperson).

Hint:

(i) How many different selections result in the committee containing exactly kpeople?

(ii) How many different selections are there in which the chairperson and the secretary are the same?

(answer: n2n−1.)

(iii) How many different selections result in the chairperson and the secretary being different?

(c) Now argue that

localid="1647960575612" ∑k=1nnkk3=2n-3n2(n+3)

How many vectors x1,...,xkare there for which each role="math" localid="1647853392605" xiis a positive integer such that role="math" localid="1647853435585" 1≤xi≤nandrole="math" localid="1647853511159" x1<x2<···<xk?

Two experiments are to be performed. The first can result in any one of m possible outcomes. If the first experiment results in outcome i, then the second experiment can result in any of ni possible outcomes, i = 1, 2, ..., m. What is the number of possible outcomes of the two experiments?

See all solutions

Recommended explanations on Math Textbooks

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.