Challenging Mathematical Problems with Elementary Solutions, 第 1 卷Holden-Day, 1964 - 440 頁 |
搜尋書籍內容
第 1 到 3 筆結果,共 44 筆
第 24 頁
... Remark . For other methods of determining this sum , see the solutions to problems 571 , 60a , 61c . 73a . Banach's matchbox problem . A man buys two boxes of matches and puts them in his pocket . Every time he has to light a match , he ...
... Remark . For other methods of determining this sum , see the solutions to problems 571 , 60a , 61c . 73a . Banach's matchbox problem . A man buys two boxes of matches and puts them in his pocket . Every time he has to light a match , he ...
第 34 頁
... remark below ) . In the following problems , however , such doubt can scarcely arise : in all of them it is possible to define “ at random " in almost the same way as in the above examples , and this is the way the term is to be ...
... remark below ) . In the following problems , however , such doubt can scarcely arise : in all of them it is possible to define “ at random " in almost the same way as in the above examples , and this is the way the term is to be ...
第 49 頁
... Remark . If there are n different flavors available and the number of ice cream cones to be selected is m , then the number of ways of choosing them is m + n n 1 - m n -1 ) . · 1 ) - ( " + " - 1 ) m This can be proved in exactly the ...
... Remark . If there are n different flavors available and the number of ice cream cones to be selected is m , then the number of ways of choosing them is m + n n 1 - m n -1 ) . · 1 ) - ( " + " - 1 ) m This can be proved in exactly 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 given Hence inclusion and exclusion intersection k-gons knights L₁ length mathematical induction maximum number n-gon number of different number of favorable number of paths number of shortest obtain pairs partition passengers plane points A1 polygons positive integers possible outcomes Pr{E probability theory problem 54 prove queens rectangle relatively prime remaining required probability rooks segment selected at random sequence shortest paths side solution to problem solved sphere square controlled Suppose T₂ total number triangle unfavorable values vertex vertices