Challenging Mathematical Problems with Elementary Solutions: Combinatorial analysis and probability theoryHolden-Day, 1964 |
搜尋書籍內容
第 1 到 3 筆結果,共 47 筆
第 10 頁
... squares of its row and column , up to and including the first square occupied by another piece . A bishop controls all squares of the diagonals on which it lies up to and including the first square occupied by another piece . The queen ...
... squares of its row and column , up to and including the first square occupied by another piece . A bishop controls all squares of the diagonals on which it lies up to and including the first square occupied by another piece . The queen ...
第 83 頁
... squares : either there are bishops on the squares marked with circles and not on those marked with crosses , or vice versa . ― Any of the n -2 squares of the bottom row which are not corner squares can be taken as the one marked with a ...
... squares : either there are bishops on the squares marked with circles and not on those marked with crosses , or vice versa . ― Any of the n -2 squares of the bottom row which are not corner squares can be taken as the one marked with a ...
第 99 頁
... squares of this rectangle ( these squares are marked by circles in fig . 47a ) . In this case we must leave empty the squares of the first rectangle which are marked by crosses : the two squares in the third row are controlled by the ...
... squares of this rectangle ( these squares are marked by circles in fig . 47a ) . In this case we must leave empty the squares of the first rectangle which are marked by crosses : the two squares in the third row are controlled by the ...
其他版本 - 查看全部
常見字詞
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