Register

Recent questions tagged descriptive

0 votes
1 answer
452
Kenneth Rosen Edition 7 Exercise 6.3 Question 13 (Page No. 413)
A group contains $n$ men and $n$ women. How many ways are there to arrange these people in a row if the men and women alternate?
A group contains $n$ men and $n$ women. How many ways are there to arrange these people in a row if the men and women alternate?
User Avatar
0 votes
1 answer
453
Kenneth Rosen Edition 7 Exercise 6.3 Question 12 (Page No. 413)
How many bit strings of length $12$ contain exactly three $1s?$ at most three $1s?$ at least three $1s?$ an equal number of $0s\: \text{and}\: 1s?$
How many bit strings of length $12$ containexactly three $1s?$ at most three $1s?$ at least three $1s?$ an equal number of $0s\: \text{and}\: 1s?$
User Avatar
0 votes
1 answer
454
Kenneth Rosen Edition 7 Exercise 6.3 Question 11 (Page No. 413)
How many bit strings of length $10$ contain exactly four $1s?$ at most four $1s?$ at least four $1s?$ an equal number of $0s$ and $1s?$
How many bit strings of length $10$ containexactly four $1s?$at most four $1s?$at least four $1s?$an equal number of $0s$ and $1s?$
User Avatar
0 votes
1 answer
455
Kenneth Rosen Edition 7 Exercise 6.3 Question 10 (Page No. 413)
There are six different candidates for governor of a state. In how many different orders can the names of the candidates be printed on a ballot?
There are six different candidates for governor of a state. In how many different orders can the names of the candidates be printed on a ballot?
User Avatar
0 votes
1 answer
456
Kenneth Rosen Edition 7 Exercise 6.3 Question 9 (Page No. 413)
How many possibilities are there for the win, place, and show (first, second, and third) positions in a horse race with $12$ horses if all orders of finish are possible?
How many possibilities are there for the win, place, and show (first, second, and third) positions in a horse race with $12$ horses if all orders of finish are possible?
User Avatar
0 votes
1 answer
461
Kenneth Rosen Edition 7 Exercise 6.3 Question 4 (Page No. 413)
Let $S = \{1, 2, 3, 4, 5\}.$ List all the $3$-permutations of $S$. List all the $3$-combinations of $S.$
Let $S = \{1, 2, 3, 4, 5\}.$List all the $3$-permutations of $S$.List all the $3$-combinations of $S.$
User Avatar
0 votes
0 answers
465
Kenneth Rosen Edition 7 Exercise 6.2 Question 47 (Page No. 407)
An alternative proof of Theorem $3$ ... there is no increasing subsequence of length $n + 1,$ then there must be a decreasing subsequence of this length.
An alternative proof of Theorem $3$ based on the generalized pigeonhole principle is outlined in this exercise. The notation used is the same as that used in the proof in...
User Avatar
0 votes
0 answers
468
Kenneth Rosen Edition 7 Exercise 6.2 Question 44 (Page No. 406)
There are $51$ houses on a street. Each house has an address between $1000\: \text{and}\: 1099,$ inclusive. Show that at least two houses have addresses that are consecutive integers.
There are $51$ houses on a street. Each house has an address between $1000\: \text{and}\: 1099,$ inclusive. Show that at least two houses have addresses that are consecut...
User Avatar
1 votes
1 answer
472
Kenneth Rosen Edition 7 Exercise 6.2 Question 40 (Page No. 406)
Prove that at a party where there are at least two people, there are two people who know the same number of other people there.
Prove that at a party where there are at least two people, there are two people who know the same number of other people there.
User Avatar
0 votes
0 answers
477
Kenneth Rosen Edition 7 Exercise 6.2 Question 35 (Page No. 406)
There are $38$ different time periods during which classes at a university can be scheduled. If there are $677$ different classes, how many different rooms will be needed?
There are $38$ different time periods during which classes at a university can be scheduled. If there are $677$ different classes, how many different rooms will be needed...
User Avatar
Page: