Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 46 筆
第 20 頁
... experiment , and suppose that the experiment is performed n times . Then A will be the outcome a certain number n of times , where 0 ≤ n ≤n . If the ratio n / n approaches a limit p as n becomes indefinitely large , we say that p is ...
... experiment , and suppose that the experiment is performed n times . Then A will be the outcome a certain number n of times , where 0 ≤ n ≤n . If the ratio n / n approaches a limit p as n becomes indefinitely large , we say that p is ...
第 21 頁
... 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 the number of times that E ...
... 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 the number of times that E ...
第 149 頁
... experiment of choosing n + ( n − k ) = 2n − k matches , selecting the box from which each is taken at random ( as the 2n k + 1st match is assumed to come from A , its selection is not part of the experiment ) . There are 22n - k ...
... experiment of choosing n + ( n − k ) = 2n − k matches , selecting the box from which each is taken at random ( as the 2n k + 1st match is assumed to come from A , its selection is not part of the experiment ) . There are 22n - k ...
其他版本 - 查看全部
常見字詞
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