| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 4 months |
| seen | Jan 2 at 14:32 | |
| stats | profile views | 13 |
|
Jan 2 |
awarded | Scholar |
|
Jan 2 |
accepted | Algorithm creating subsets with certain properties |
|
Jan 1 |
awarded | Supporter |
|
Jan 1 |
comment |
Algorithm creating subsets with certain properties Thanks, interesting and simple solution! So we know how to get 210 sets, and now I must think harder and try to find a way to make less sets. |
|
Jan 1 |
comment |
Algorithm creating subsets with certain properties One more remark: I am trying also make "n" small as possible. I see one way to solve the problem, but not much elegant: I can generate 24 sets Ai with random numbers, then check all possible 13,983,816 6-element subsets of A (using Java), and then for those 6-element subsets, that are not contained in any Ai, generate additional Ai sets. In this way I can not get n small as possible.I thought, maybe there is more elegant mathematical way to solve my problem. |
|
Jan 1 |
comment |
Algorithm creating subsets with certain properties Thanks! Yes, or in other words: to make sure that any 6-element subset of A is contained at least in one of sets Ai. |
|
Jan 1 |
awarded | Student |
|
Jan 1 |
asked | Algorithm creating subsets with certain properties |