Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 15 筆
第 28 頁
... sequence of numbers A1 , A2 , A3 , ... Suppose that the first N of these numbers are written on N slips of paper , the slips thoroughly mixed , and then one of them drawn at random . This experiment has N equally probable outcomes ; if ...
... sequence of numbers A1 , A2 , A3 , ... Suppose that the first N of these numbers are written on N slips of paper , the slips thoroughly mixed , and then one of them drawn at random . This experiment has N equally probable outcomes ; if ...
第 150 頁
... sequence { a1 , a2 , ... , aso } by putting a = 1 if A hits a duck on his n - th shot and a = 0 otherwise ... sequence S = { a1 , a2 , , a50 , b1 , b2 , ... , b51 } then completely describes the outcome of the hunt . Since the ...
... sequence { a1 , a2 , ... , aso } by putting a = 1 if A hits a duck on his n - th shot and a = 0 otherwise ... sequence S = { a1 , a2 , , a50 , b1 , b2 , ... , b51 } then completely describes the outcome of the hunt . Since the ...
第 199 頁
... sequence of digits which represents the number M in the decimal notation . This is equivalent to proving that for ... sequence of distinct points A1 , A2 , A3 , . . . ( see fig . 69 , where the first 15 points A1 , A2 , A3 , . . . , А15 ...
... sequence of digits which represents the number M in the decimal notation . This is equivalent to proving that for ... sequence of distinct points A1 , A2 , A3 , . . . ( see fig . 69 , where the first 15 points A1 , A2 , A3 , . . . , А15 ...
其他版本 - 查看全部
常見字詞
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