Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 20 筆
第 168 頁
... segment АA , of length 1 either to the right ( if the first customer has a five - dollar bill ) or upwards ( if he has only a ten - dollar bill ) . From the point A1 , lay off a segment А12 of length 1 either to the right or upwards ...
... segment АA , of length 1 either to the right ( if the first customer has a five - dollar bill ) or upwards ( if he has only a ten - dollar bill ) . From the point A1 , lay off a segment А12 of length 1 either to the right or upwards ...
第 169 頁
... segment of such a path must be horizontal . It follows from this that every path corresponding to an unfavorable outcome must cross the line L , or what is the same thing , must have a vertex lying on the line L , which is parallel to L ...
... segment of such a path must be horizontal . It follows from this that every path corresponding to an unfavorable outcome must cross the line L , or what is the same thing , must have a vertex lying on the line L , which is parallel to L ...
第 173 頁
... segment A¡4 + 1 is horizontal . But even such a point A ; need not be illuminated , for the segment A.A1 + 1 may lie in the shade cast by a later vertical segment . Denote by v the number of vertical unit segments of the path A。, A1 ...
... segment A¡4 + 1 is horizontal . But even such a point A ; need not be illuminated , for the segment A.A1 + 1 may lie in the shade cast by a later vertical segment . Denote by v the number of vertical unit segments of the path A。, A1 ...
其他版本 - 查看全部
常見字詞
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 length mathematical induction maximum number multiple 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