Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 31 筆
第 145 頁
... favorable outcomes are obviously the nine in which the right number comes up the first time and some other number the second time , and the nine outcomes in which one of the nine wrong numbers comes up the first time and the right ...
... favorable outcomes are obviously the nine in which the right number comes up the first time and some other number the second time , and the nine outcomes in which one of the nine wrong numbers comes up the first time and the right ...
第 148 頁
... outcomes in a set of four games is 24 = 16 , since each game has two possible outcomes . These are all equally likely , since A and B are equally strong . The favorable outcomes are those in which B wins only one game out of the four ...
... outcomes in a set of four games is 24 = 16 , since each game has two possible outcomes . These are all equally likely , since A and B are equally strong . The favorable outcomes are those in which B wins only one game out of the four ...
第 158 頁
... favorable outcomes . First of all , it is quite clear that for odd n the number of favorable outcomes ( and consequently , also the required probability p1 ) equals zero : if the total number of white balls is odd , at least one of the ...
... favorable outcomes . First of all , it is quite clear that for odd n the number of favorable outcomes ( and consequently , also the required probability p1 ) equals zero : if the total number of white balls is odd , at least one of the ...
其他版本 - 查看全部
常見字詞
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