Timeline for Creating a combinations with unique sets
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 29, 2013 at 11:40 | history | suggested | Abhimanyu Pallavi Sudhir | CC BY-SA 3.0 |
OEIS link updated.
|
| Oct 29, 2013 at 11:36 | review | Suggested edits | |||
| S Oct 29, 2013 at 11:40 | |||||
| Jun 2, 2010 at 17:43 | vote | accept | khuss | ||
| Jun 2, 2010 at 5:26 | comment | added | Gerry Myerson | If you follow the links at the sequences site, I think you'll find there are formulas for $r\le4$ but only estimates for $r\ge5$. Anyway, if you're happy with my answer, I think the usual thing to do is to click the check mark next to it. | |
| Jun 2, 2010 at 4:42 | comment | added | user6491 | Yes. You captured it beautifully. Thanks Gerry! I didn't think it as a geometrical problem, which is very interesting. Now, I need to figure out if there is any standard way to generate these combinations for a very large set of numbers - let us say 1000 numbers. I imagine if I can solve it for small set, it could be scaled for a large set. Also, I need to find if there is any mathematical equation to calculate the number of possible sets that have at most one intersecting element. | |
| Jun 2, 2010 at 4:11 | history | edited | Gerry Myerson | CC BY-SA 2.5 |
Replaced incorrect answer, possibly with correct one
|
| Jun 1, 2010 at 0:21 | history | answered | Gerry Myerson | CC BY-SA 2.5 |