| 
         | 
        
            
                Электронная библиотека Попечительского совета механико-математического факультета  Московского государственного университета
            
         | 
          | 
     
 
 
    
	    
	    | 
		    
	     | 
	    
	      | 
	    
	    
            
		 |  
                
                    | Niven I. - Mathematics of Choice: How to Count Without Counting | 
                  
                
                    | 
                        
                     | 
                 
                                                                
			          | 
	          
                
                    | Предметный указатель | 
                  
                
                    
                        Addition principle      16  
Binomial expansion      34  
Binomial theorem      34  
Chromatic triangles      122  
Circular permutations      23  
Combinations      18  
Combinations, property of      154  
Combinations, with repetitions      59 76  
Combinatorial probability      82  
Complementary probability      86  
configuration problems      120  
Debrunner, H.      199  
Derangements      78  
digit      15  
Distributions      109 110  
Dollar bill, change for      106  
Factorial zero      16  
Factorials      10  
Fibonacci numbers      50  
Fibonacci numbers, formulas for      52 66  
Fibonacci numbers, property of      154  
Generating polynomials      100  
Gleason, A. M.      124 157  
Graphs of partitions      92  
Greenwood, R. E.      124 157  
Hadwiger, H.      199  
Inclusion-Exclusion Principle      67 70 74  
Incompatible permutations      81  
Induction, principle of mathematical      130  
INTEGER      4  
Klee, V.      199  
Linear equations with restricted solutions      60 75  
Linear equations with unit coefficients      54  
Mathematical induction      129  
Multinomial expansion      38  
Multiplication principle      8  
 | Non-associative product      140  
Non-associative product, number of interpretations of      152  
Notation      see 'Symbols'  
Notation for products      137  
Notation for sums      134  
Olds, C.D.      53  
Partitions of a set      112  
Partitions of an integer      91 102  
Partitions of an integer, graphs of      92  
Partitions of an integer, number of      96  
Pascal's formula for C(n, r)      31  
Pascal's triangle      41  
Pascal's triangle, applications of      148  
permutations      12  
Permutations, in a circle      23  
Permutations, incompatible      81  
Permutations, of things not all alike      28  
Pigeonhole Principle      120  
Principle of Mathematical Induction      130  
probability      82  
Product, non-associative      140  
Product, notation for      137  
Proper subsets      43  
Riordan, John      199  
Ryser, H. J.      199  
Separations of the plane      124  
subsets      42  
Subsets, proper      43  
Sum,   notation for      134  
Sum, telescoping      45 125  
Summands      91  
Sums of powers of natural numbers      44  
symbols      see list below  
Telescoping sum      45 125  
Tower of Hanoi puzzle      156  
Whitworth, W. A.      199  
Zero factorial      16  
 |   
                            
                     | 
                  
			  | 
		          
			| Реклама |  
			  | 
		          
			 |  
                             
         | 
	    
 
 
      |  
      |  
	
 
 |