Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 45 筆
第 78 頁
... least 4 rooks are needed to control the squares of fig . 30b since it contains a 4 x 4 square to which problem 34b can be applied . Thus we need at least 4 black bishops , and similarly we need at least 4 white bishops . On the other ...
... least 4 rooks are needed to control the squares of fig . 30b since it contains a 4 x 4 square to which problem 34b can be applied . Thus we need at least 4 black bishops , and similarly we need at least 4 white bishops . On the other ...
第 152 頁
... least one of the hunters draws the " Hit " slip , that is , the five outcomes in the bottom row and rightmost column of the above table . Thus the probability that at least one of the hunters hits the fox is 5/9 . = 75b . Combining each ...
... least one of the hunters draws the " Hit " slip , that is , the five outcomes in the bottom row and rightmost column of the above table . Thus the probability that at least one of the hunters hits the fox is 5/9 . = 75b . Combining each ...
第 184 頁
... least twice as many objects with property X as objects with property Y stand in front of each object in the sequence ? any integerr ( it is especially simple to = In this form the problem admits a completely natural generalization : one ...
... least twice as many objects with property X as objects with property Y stand in front of each object in the sequence ? any integerr ( it is especially simple to = In this form the problem admits a completely natural generalization : one ...
其他版本 - 查看全部
常見字詞
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