Challenging Mathematical Problems with Elementary Solutions, 第 1 卷Holden-Day, 1964 - 440 頁 |
搜尋書籍內容
第 1 到 3 筆結果,共 62 筆
第 21 頁
... example we might wish to know the probability that an even number will turn up when a die is thrown . In this case the given set of outcomes consists of 2 , 4 , and 6 . Such a set E is called an event ; if the outcome of the experiment ...
... example we might wish to know the probability that an even number will turn up when a die is thrown . In this case the given set of outcomes consists of 2 , 4 , and 6 . Such a set E is called an event ; if the outcome of the experiment ...
第 174 頁
... example , in fig . 62b , n = 7 , m = 4 , and exactly 743 of the points are illuminated . We have thus proved that for n > m exactly m of the n + m arrangements of customers obtained from any one arrangement by successively putting the ...
... example , in fig . 62b , n = 7 , m = 4 , and exactly 743 of the points are illuminated . We have thus proved that for n > m exactly m of the n + m arrangements of customers obtained from any one arrangement by successively putting the ...
第 209 頁
... example , Hardy and Wright , An Introduction to the Theory of Numbers , Oxford , 1960 , p . 47 ) . Of course there are much simpler proofs of the infinitude of the primes ; the above is an example of cracking open a walnut with a ...
... example , Hardy and Wright , An Introduction to the Theory of Numbers , Oxford , 1960 , p . 47 ) . Of course there are much simpler proofs of the infinitude of the primes ; the above is an example of cracking open a walnut with 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