Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 13 筆
第 172 頁
... customers with five - dollar bills than there are with ten - dollar bills ahead of that point . In order for event B to occur , the first customer must have a five - dollar bill , and the remaining n + m . 1 customers must be arranged ...
... customers with five - dollar bills than there are with ten - dollar bills ahead of that point . In order for event B to occur , the first customer must have a five - dollar bill , and the remaining n + m . 1 customers must be arranged ...
第 174 頁
... customers obtained from any one arrangement by successively putting the first customer at the end of the line have ... customers with fives and three customers with only tens can be arranged in the following order : 5 10 5 5 10 5 5 10 5 ...
... customers obtained from any one arrangement by successively putting the first customer at the end of the line have ... customers with fives and three customers with only tens can be arranged in the following order : 5 10 5 5 10 5 5 10 5 ...
第 178 頁
... customer must have a five - dollar bill , and the remaining 1 customers must be arranged so that among themselves ( i.e. , excluding the first customer ) they satisfy the conditions for event C. Hence if n > 0 , we have n + m - p ( n ...
... customer must have a five - dollar bill , and the remaining 1 customers must be arranged so that among themselves ( i.e. , excluding the first customer ) they satisfy the conditions for event C. Hence if n > 0 , we have n + m - p ( n ...
其他版本 - 查看全部
常見字詞
A₁ A₂ An+m arrangements b₁ B₂ binomial coefficients binomial theorem bishops black squares C₁ chessboard chord circle coefficient color column compute the number Consequently consider corresponding customers denote determine the number diagonals digits dihedral angle divided divisible draw equally likely possible equation equidistant equivalence classes exactly example experiment favorable outcomes follows formula G₁ given Hence inclusion and exclusion intersection k-gons knights length mathematical induction maximum number n-gon number of different number of favorable number of paths number of shortest obtain pairs partition passengers plane polygons positive integers possible outcomes Pr{E probability theory problem 54 prove queens rectangle relatively prime remaining required probability rooks S₁ segment selected at random sequence shortest paths side solution to problem solved sphere square controlled Suppose T₂ total number triangle unfavorable values vertex vertices