Timeline for Proofs without words
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 29, 2017 at 20:55 | history | edited | j.c. | CC BY-SA 3.0 |
fix images
|
| Feb 24, 2012 at 1:04 | history | edited | Roberto Mizzoni | CC BY-SA 3.0 |
deleted 16 characters in body
|
| Feb 19, 2012 at 22:40 | history | edited | Roberto Mizzoni | CC BY-SA 3.0 |
added 331 characters in body
|
| Feb 15, 2012 at 21:05 | comment | added | Roberto Mizzoni | I find it just as visual, and very clean, but even harder to depict. | |
| Feb 15, 2012 at 15:05 | comment | added | Steven Gubkin | For me the standard argument is just as visual, and clearer: I have n!/(n-k)! ordered lists of length k with no repetitions from an alphabet of n letters. If I group together all words using the same letters, there are k! members of each group, hence n!/(n-k)!(k!) groups. Each group corresponds to an unordered list. | |
| Feb 15, 2012 at 0:00 | history | answered | Roberto Mizzoni | CC BY-SA 3.0 |