Challenging Mathematical Problems with Elementary Solutions, 第 1 卷Holden-Day, 1964 - 440 頁 |
搜尋書籍內容
第 1 到 3 筆結果,共 6 筆
第 23 頁
... cards bearing respectively the letters A , B , C , D , E , and F are shuffled thoroughly , and then the top four cards are turned face up ( without changing the order in which they lay on top of the shuffled pack ) . What is the ...
... cards bearing respectively the letters A , B , C , D , E , and F are shuffled thoroughly , and then the top four cards are turned face up ( without changing the order in which they lay on top of the shuffled pack ) . What is the ...
第 27 頁
... card game there are m + n players and a banker who does not play but only collects and distributes money . At the beginning of the game there is no money in the bank . A pack consisting of m cards marked " win " and n cards marked ...
... card game there are m + n players and a banker who does not play but only collects and distributes money . At the beginning of the game there is no money in the bank . A pack consisting of m cards marked " win " and n cards marked ...
第 147 頁
... cards into two sets A and B of five cards each . The total number of 10 ways of choosing the set A is = 252 , and so there are 252 equally ( 19 ) = likely possible outcomes . We must now determine the number of favorable outcomes for ...
... cards into two sets A and B of five cards each . The total number of 10 ways of choosing the set A is = 252 , and so there are 252 equally ( 19 ) = likely possible outcomes . We must now determine the number of favorable outcomes for ...
其他版本 - 查看全部
常見字詞
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