Challenging Mathematical Problems with Elementary Solutions, 第 1 卷Holden-Day, 1964 - 440 頁 |
搜尋書籍內容
第 1 到 3 筆結果,共 9 筆
第 18 頁
... shortest paths joining the two houses , for each of these shortest paths is m + n blocks long - m blocks in the horizontal direction and n blocks in the vertical direction . A path is described unambiguously by specifying which of the m ...
... shortest paths joining the two houses , for each of these shortest paths is m + n blocks long - m blocks in the horizontal direction and n blocks in the vertical direction . A path is described unambiguously by specifying which of the m ...
第 181 頁
... shortest paths from Ao to An + m which first meet L1 at the point D , with the number of such shortest paths from Ao ' to An + m ' The number of shortest paths from Ao to An + m which pass through the point D1 is equal to NAD1ND14n + m ...
... shortest paths from Ao to An + m which first meet L1 at the point D , with the number of such shortest paths from Ao ' to An + m ' The number of shortest paths from Ao to An + m which pass through the point D1 is equal to NAD1ND14n + m ...
第 182 頁
... paths which join Ao ' to An + m is ND34n + m NA'D2 NDзAn + m - NA'D2 ND2D ND1d + m - · · Ν NA'D2 ND2D , NDз4n + m + ... shortest paths from A to An + m which first meet the line L , at the point D is exactly twice the number of shortest ...
... paths which join Ao ' to An + m is ND34n + m NA'D2 NDзAn + m - NA'D2 ND2D ND1d + m - · · Ν NA'D2 ND2D , NDз4n + m + ... shortest paths from A to An + m which first meet the line L , at the point D is exactly twice the number of shortest ...
其他版本 - 查看全部
常見字詞
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