Challenging Mathematical Problems with Elementary Solutions, 第 1 卷Holden-Day, 1964 - 440 頁 |
搜尋書籍內容
第 1 到 3 筆結果,共 44 筆
第 23 頁
... Suppose that a boy remembers all but the last figure of his girl friend's telephone number and decides to choose the last figure at random in an attempt to reach her . If he has only two dimes in his pocket , what is the probability ...
... Suppose that a boy remembers all but the last figure of his girl friend's telephone number and decides to choose the last figure at random in an attempt to reach her . If he has only two dimes in his pocket , what is the probability ...
第 39 頁
... suppose I is a line equidistant from them . If A , B , C were all on the same side of 1 , they would lie on a line parallel to 1 , contradicting the hypothesis . Therefore two of the points are on one side of I and the third point is on ...
... suppose I is a line equidistant from them . If A , B , C were all on the same side of 1 , they would lie on a line parallel to 1 , contradicting the hypothesis . Therefore two of the points are on one side of I and the third point is on ...
第 41 頁
... suppose s is a circle or straight line equidistant from them . Then A , B , C , D cannot all be on the same side of s . ( By the two sides of a circle we mean , of course , the inside and the outside . ) For they would then lie on a ...
... suppose s is a circle or straight line equidistant from them . Then A , B , C , D cannot all be on the same side of s . ( By the two sides of a circle we mean , of course , the inside and the outside . ) For they would then lie on a ...
其他版本 - 查看全部
常見字詞
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 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 total number triangle unfavorable values vertex vertices