|   | |Store| |   |   |   |  |   |   |   CTK Exchange 
      	| 
         | 
         | Proof Pudding  guest
 
 | Feb-13-02, 04:22 PM (EST) |  |  |  | "Prove n choose r" 
 
 
      |  | Hi all, I have been ask to look at the problem of proving by induction that n C r = (n!)/((n-r)!r!) , 0<= r <=n
 And I dont know where to start?? For the basis do I take n as being 0, if so r must = 0, there for the basis says n C r = 0 C r = 1.
 But what shall the inductive step consist of? If I take (n+1) C r will this work, because r isnt changing in this step so will it be a propor proof??? Please anybody help I am a bit'stuck. Thanks. |  
 |  | Alert | IP | Printer-friendly page | Edit |
         Reply |
         Reply With Quote | Top |  |  |  
 
 You may be curious to visit the old CTK Exchange archive.   
|Front page|
|Contents|
 
Copyright © 1996-2018 Alexander Bogomolny
  [an error occurred while processing this directive] | Advertise 
 
 
  
 |