Challenging Mathematical Problems with Elementary Solutions, 第 1 卷Holden-Day, 1964 - 440 頁 |
搜尋書籍內容
第 1 到 3 筆結果,共 78 筆
第 120 頁
... points be A2 , A3 , ... , A2n . The point A , can be connected to any of the points A2 , A4 , A6 , ... , Agn , but to no others ; for if it were connected to a point Am with m odd , there would be an odd number of points on each side of ...
... points be A2 , A3 , ... , A2n . The point A , can be connected to any of the points A2 , A4 , A6 , ... , Agn , but to no others ; for if it were connected to a point Am with m odd , there would be an odd number of points on each side of ...
第 200 頁
... points could be accommodated on the circle . Let A , and Ap + q be two points of our sequence whose distance apart is less than a = log ( 1 + 1 / M ) , the length of the interval I. Note that the distance between the points A , and Apt ...
... points could be accommodated on the circle . Let A , and Ap + q be two points of our sequence whose distance apart is less than a = log ( 1 + 1 / M ) , the length of the interval I. Note that the distance between the points A , and Apt ...
第 218 頁
... points which satisfy the equation x + y = z constitutes the plane which passes through the points O , E , and G , and all points for which x + y > z will be located on the same side of this plane as the point F. Similarly , the set of all ...
... points which satisfy the equation x + y = z constitutes the plane which passes through the points O , E , and G , and all points for which x + y > z will be located on the same side of this plane as the point F. Similarly , the set of all ...
其他版本 - 查看全部
常見字詞
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