Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 15 筆
第 13 頁
... n straight lines ? b . n circles ? 45 . ** What is the greatest number of parts into which three - dimensional space can be divided by : a . n planes ? b . n spheres ? 46. * In how many points do the diagonals of a convex n - gon meet ...
... n straight lines ? b . n circles ? 45 . ** What is the greatest number of parts into which three - dimensional space can be divided by : a . n planes ? b . n spheres ? 46. * In how many points do the diagonals of a convex n - gon meet ...
第 108 頁
... n - gon ( see fig . 50 ) . By associating to each set of four vertices the point at which two of its diagonals meet , we set up a one - to - one correspondence between the points of intersection and the sets of four vertices . It ...
... n - gon ( see fig . 50 ) . By associating to each set of four vertices the point at which two of its diagonals meet , we set up a one - to - one correspondence between the points of intersection and the sets of four vertices . It ...
第 115 頁
... n - gon ( fig . 54d ) . The sides B1B2 , BВ , and BB1 of this triangle are contained in diagonals A1A4 , A2A5 , and  of the n - gon . Each sextuple of vertices A1 , A2 , A3 , A4 , A5 , A6 of our n - gon accounts for the single ...
... n - gon ( fig . 54d ) . The sides B1B2 , BВ , and BB1 of this triangle are contained in diagonals A1A4 , A2A5 , and  of the n - gon . Each sextuple of vertices A1 , A2 , A3 , A4 , A5 , A6 of our n - gon accounts for the single ...
其他版本 - 查看全部
常見字詞
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