| title | date | draft | tags | categories | |||
|---|---|---|---|---|---|---|---|
Algorithm4 Java Solution 1.4.01 |
2019-08-06 15:54:00 +0800 |
false |
|
|
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.