| title | Algorithm4 Java Solution 1.4.01 | ||
|---|---|---|---|
| date | 2019-08-06 15:54:00 +0800 | ||
| draft | false | ||
| tags |
|
||
| categories |
|
Show that the number of different triples that can be chosen from N items is precisely N(N-1)(N-2)/6. Hint : Use mathematical induction.
| title | Algorithm4 Java Solution 1.4.01 | ||
|---|---|---|---|
| date | 2019-08-06 15:54:00 +0800 | ||
| draft | false | ||
| tags |
|
||
| categories |
|
Show that the number of different triples that can be chosen from N items is precisely N(N-1)(N-2)/6. Hint : Use mathematical induction.