Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 13 筆
第 21 頁
... event ; if the outcome of the experiment is in E , we say that the event E has occurred . The a posteriori probability of an event E is defined in the same way as for a single outcome ; we perform the experiment n times , let n denote ...
... event ; if the outcome of the experiment is in E , we say that the event E has occurred . The a posteriori probability of an event E is defined in the same way as for a single outcome ; we perform the experiment n times , let n denote ...
第 22 頁
... event consisting of all outcomes which are in both E and F. For example , in the experiment of throwing a die , if E ... event that a head comes up on the first toss , and let F be the event that a head comes up on the second toss . Then ...
... event consisting of all outcomes which are in both E and F. For example , in the experiment of throwing a die , if E ... event that a head comes up on the first toss , and let F be the event that a head comes up on the second toss . Then ...
第 172 頁
... event B that at each point of the line ( including the end ) there are more 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 ...
... event B that at each point of the line ( including the end ) there are more 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 ...
其他版本 - 查看全部
常見字詞
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