Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 49 筆
第 50 頁
... compute how many of the integers under consideration do not have any l's among their digits . By adjoining 0 and deleting 10,000,000,000 , we obtain a sequence of 101o numbers in which there is one more number with no 1's among its ...
... compute how many of the integers under consideration do not have any l's among their digits . By adjoining 0 and deleting 10,000,000,000 , we obtain a sequence of 101o numbers in which there is one more number with no 1's among its ...
第 145 頁
... compute how many of these outcomes are favorable , that is , such that the birthdays all occur in different months . In a favorable outcome , the first person's birthday can occur in any month , but the second person's birthday must ...
... compute how many of these outcomes are favorable , that is , such that the birthdays all occur in different months . In a favorable outcome , the first person's birthday can occur in any month , but the second person's birthday must ...
第 158 頁
... compute the number of favorable outcomes in which k specific people of the 2k participants each draw a pair of white balls ( and consequently , the other k each draw a pair of black balls ) . The k people can each draw a pair of white ...
... compute the number of favorable outcomes in which k specific people of the 2k participants each draw a pair of white balls ( and consequently , the other k each draw a pair of black balls ) . The k people can each draw a pair of white ...
其他版本 - 查看全部
常見字詞
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