Timeline for What is the minimum set of combinations C(p,n) required to guarantee q<p matches with a target combination (pT,n)
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 10, 2010 at 16:05 | comment | added | Walter Baeck | Thanks Nathann. The paper you referred to, has numerical results for small cases. No closed solution for the general case seems yet to exist. I understand now, why my question was not used on Project Euler. | |
| Aug 10, 2010 at 16:02 | vote | accept | Walter Baeck | ||
| Aug 9, 2010 at 15:33 | history | answered | Nathann Cohen | CC BY-SA 2.5 |