Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 21 筆
第 108 頁
A. M. I︠A︡glom, Isaak Moiseevich I︠A︡glom Basil Gordon. n - gon . The diagonal joining the first and third points will intersect the diagonal joining the second and fourth points , and no other pair of diagonals joining these four ...
A. M. I︠A︡glom, Isaak Moiseevich I︠A︡glom Basil Gordon. n - gon . The diagonal joining the first and third points will intersect the diagonal joining the second and fourth points , and no other pair of diagonals joining these four ...
第 137 頁
... joining the intersection ( 1,0 ) to the intersection ( n − m + 1 , m ) , ---- that is , ( m ) . The second class shall consist of those paths which start by going one block up the " vertical " street to the intersection ( 0,1 ) and ...
... joining the intersection ( 1,0 ) to the intersection ( n − m + 1 , m ) , ---- that is , ( m ) . The second class shall consist of those paths which start by going one block up the " vertical " street to the intersection ( 0,1 ) and ...
第 155 頁
... joining the upper ends there are exactly 4.2 8 ways of joining the lower ends which lead to favorable outcomes to the experiment . It follows from this that the total number of favorable outcomes is 15.8 0.53 . = = 120 . Thus the ...
... joining the upper ends there are exactly 4.2 8 ways of joining the lower ends which lead to favorable outcomes to the experiment . It follows from this that the total number of favorable outcomes is 15.8 0.53 . = = 120 . Thus 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