Timeline for How to calculate an index into a binomial coefficient table from the underlying indexes
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2012 at 8:17 | comment | added | Robert Bryan | Thanks for the responses. I tried looking for the algorithm and mathematical concept behind it, but did not find it in any of Knuth's texts in "The Art of Computer Programming". I have also done many web searches and could not find it. I think I am the first to publish on how to efficiently convert a k-indexes bounded by the binomial coefficent to the correct entry in a table, which is also the rank. The link to the wikopedia article below describes how to convert between the rank and the corresponding k-indexes, but does not talk about the technique that I disovered. | |
| Nov 18, 2011 at 5:21 | comment | added | Dimitrije Kostic | Whenever I encounter a sequence of integers I don't recognize, the first place I check is oeis.org, Neil Sloane's online Encyclopedia of Integer Sequences. Many of the entries include formulas and algorithms. It's an invaluable reference. | |
| Nov 4, 2011 at 11:20 | comment | added | Federico Poloni | I guess "Yes, read Knuth" is a little bit like "Yes, read Lang" or "Yes, read Bourbaki", but for computer science? :) | |
| Aug 11, 2011 at 22:45 | answer | added | Gerry Myerson | timeline score: 1 | |
| Aug 11, 2011 at 22:37 | comment | added | Gerhard Paseman | Briefly, Yes; read Knuth. More generally, do some web searches and ask on a CSTHeory or programming forum. Gerhard "Ask Me About System Design" Paseman, 2011.08.11 | |
| Aug 11, 2011 at 22:22 | history | asked | Robert Bryan | CC BY-SA 3.0 |