6 - a) In how many ways can hats and gloves be returned so...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
1 d n = n ![1 1 1! + 1 2! ··· +( 1) n 1 n ! ]
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Only the numbered squares are part of this chessboard C .
Background image of page 2
3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4
Background image of page 4
5 Determine the rook polynomial for the chessboard from Fig. 8.8 using the recurrence relation (4).
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 The number of ways we can seat these four relatives and satisfy (a) - (d) is the number of ways four nontaking rooks can be placed on the chessboard made up of noncrossed squares. If the number of crossed squares is smaller than the number of noncrossed (7 < 13), we can obtain solution using the crossed chessboard instead. This time we employ the inclusion/exclusion.
Background image of page 6
7
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8 Five gentleness meet in pub and they all leave their hats and gloves at the entrance. As they are leaving they decide to take their belongings at random.
Background image of page 8
Background image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a) In how many ways can hats and gloves be returned so that no gentleman gets either of his possession, i.e. will not get his hat and will not get his gloves. b) In how many ways can hats and gloves be returned so that no gentleman gets back both their possession, i.e. if he gets hat, then will not get gloves, and vice versa. 9 A pair of dice, one red and one green, is rolled six times. What is the probability that every value came up on both the red and green die under the assumption that the ordered pair (1,1), (1,5), (2,1), (2,5), (3,6), (4,2), (4,4), and (5,4) did not come up?...
View Full Document

Page1 / 9

6 - a) In how many ways can hats and gloves be returned so...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online