Timeline for Order of a combination when mapping them to whole numbers
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 31, 2013 at 0:01 | vote | accept | Claudiu | ||
| Jun 30, 2010 at 17:58 | comment | added | Robin Chapman | You might consult Knuth's TAOCP 4.3 "Generating all Combinations and Partitions" amazon.co.uk/Art-Computer-Programming-Fascicle-Combinations/dp/… but perhaps you'll find there more information than you ever wanted to know :-) | |
| Jun 30, 2010 at 17:03 | answer | added | Max Alekseyev | timeline score: 5 | |
| Jun 30, 2010 at 0:13 | comment | added | Wadim Zudilin | There was a related question: mathoverflow.net/questions/24481 | |
| Jun 29, 2010 at 18:09 | comment | added | Martin Rubey | this is usually called ranking and unranking. Searching the web with "combinations, ranking, unranking" should give you some hints. Possibly you find 1stworks.com/ref/RuskeyCombGen.pdf helpful. | |
| Jun 29, 2010 at 18:01 | answer | added | Charles Matthews | timeline score: 1 | |
| Jun 29, 2010 at 17:36 | history | asked | Claudiu | CC BY-SA 2.5 |