Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 61 筆
第 頁
... given first , followed by a section giving complete solutions . Answers and hints are given at the end of the book . For most of the problems the reader is advised to find a solution by himself . After solving the problem , he should ...
... given first , followed by a section giving complete solutions . Answers and hints are given at the end of the book . For most of the problems the reader is advised to find a solution by himself . After solving the problem , he should ...
第 5 頁
... given , not all on the same straight line , and not all on a circle . How many straight lines and circles can be drawn which are equidistant from these points ? ( By the distance from a point P to a circle c with center O we mean the ...
... given , not all on the same straight line , and not all on a circle . How many straight lines and circles can be drawn which are equidistant from these points ? ( By the distance from a point P to a circle c with center O we mean the ...
第 34 頁
... given direction and interpret the term " at random " as follows ( fig . 11a ) . Draw the diameter which is perpen- dicular to the given direction ; each chord is uniquely determined by specifying the point at which it meets this ...
... given direction and interpret the term " at random " as follows ( fig . 11a ) . Draw the diameter which is perpen- dicular to the given direction ; each chord is uniquely determined by specifying the point at which it meets this ...
其他版本 - 查看全部
常見字詞
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