Challenging Mathematical Problems with Elementary Solutions, 第 1 卷Holden-Day, 1964 - 440 頁 |
搜尋書籍內容
第 1 到 3 筆結果,共 48 筆
第 57 頁
... values of x , and the remaining four numbers contribute 2 values of x ( namely x = 9998 and x = 10,000 ) . So the total is 2858 ; subtracting this from 10,000 we get 10,000 - 2858 = 7142 values of x for which 2 * x2 is not divisible by ...
... values of x , and the remaining four numbers contribute 2 values of x ( namely x = 9998 and x = 10,000 ) . So the total is 2858 ; subtracting this from 10,000 we get 10,000 - 2858 = 7142 values of x for which 2 * x2 is not divisible by ...
第 65 頁
... values of m from 0 to 10 we get a total of N ( 196 ) N ( 159 ) + N ( 576 ) N ( 144 ) N ( 10 ) N ( 1296 ) + N ( 126 ) N ( 1200 ) N ( 1156 ) N ( 121 ) + N ( 1236 ) N ( 100 ) 20 = + N 20 + N N ( 2916 ) N ( 21 ) 81 + N 4096 64 N 20 20 20 + ...
... values of m from 0 to 10 we get a total of N ( 196 ) N ( 159 ) + N ( 576 ) N ( 144 ) N ( 10 ) N ( 1296 ) + N ( 126 ) N ( 1200 ) N ( 1156 ) N ( 121 ) + N ( 1236 ) N ( 100 ) 20 = + N 20 + N N ( 2916 ) N ( 21 ) 81 + N 4096 64 N 20 20 20 + ...
第 66 頁
... values 1 , 2 , ... , k − 1 ( y cannot take the value k , since then z would not be positive ) ; the corresponding value of z determined from the equation will also be a positive integer in each of these cases . Let us now turn to our ...
... values 1 , 2 , ... , k − 1 ( y cannot take the value k , since then z would not be positive ) ; the corresponding value of z determined from the equation will also be a positive integer in each of these cases . Let us now turn to our ...
其他版本 - 查看全部
常見字詞
A₁ A₂ An+m arrangements b₁ B₂ binomial coefficients binomial theorem bishops black squares 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 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 T₂ total number triangle unfavorable values vertex vertices