Chapter 1: Q. 1.10 (page 20)
How many -digit numbers can be formed from the integers if no digit can appear more than twice? (For instance, is not allowed.)
Short Answer
-digit numbers that can be formed are .
Chapter 1: Q. 1.10 (page 20)
How many -digit numbers can be formed from the integers if no digit can appear more than twice? (For instance, is not allowed.)
-digit numbers that can be formed are .
All the tools & learning materials you need for study success - in one app.
Get started for freeProve the generalized version of the basic counting principle.
From a group of women and men, a committee consisting of men and women is to be formed. How many
different committees are possible if
(a) of the men refuse to serve together?
(b) of the women refuse to serve together?
(c) man and woman refuse to serve together?
If identical blackboards are to be divided among schools, how many divisions are possible? How many of each school must receive at least a blackboard?
How many different letter arrangements can be made from the letters (a) Fluke? (b) Propose? (c) Mississippi? (d) Arrange?
Consider a tournament of contestants in which the outcome is an ordering of these contestants, with ties allowed. That is, the outcome partitions the players into groups, with the first group consisting of the players who tied for first place, the next group being those who tied for the next-best position, and so on. Let localid="1648231792067" denote the number of different possible outcomes. For instance, localid="1648231796484" , since, in a tournament with localid="1648231802600" contestants, player localid="1648231807229" could be uniquely first, player localid="1648231812796" could be uniquely first, or they could tie for first.
(a) List all the possible outcomes when .
(b) With localid="1648231819245" defined to equal localid="1648231826690" , argue without any computations, that localid="1648281124813"
Hint: How many outcomes are there in which localid="1648231837145" players tie for last place?
(c) Show that the formula of part (b) is equivalent to the following:
localid="1648285265701"
(d) Use the recursion to find N(3) and N(4).
What do you think about this solution?
We value your feedback to improve our textbook solutions.