Question #8996

Is there a formula to arrange 4845 subsets of 4 elements each into the least number of sets of 6 elements each?

example: if I have a set of 20 integers (1,2,3,...19,20), and arrange them into a list of subsets with 4 elements each, then I will end up with 4845 subsets with 4 elements each. Now, how do I set about to list these 4845 subsets so that I end up with the LEAST number of SETS of 6 elements each that contain ALL the subsets (4845)?

Thanks

example: if I have a set of 20 integers (1,2,3,...19,20), and arrange them into a list of subsets with 4 elements each, then I will end up with 4845 subsets with 4 elements each. Now, how do I set about to list these 4845 subsets so that I end up with the LEAST number of SETS of 6 elements each that contain ALL the subsets (4845)?

Thanks

Expert's answer

Unfortunately, your question requires a lot of work and cannot be done for free.

Submit it with all requirements as an assignment to our control panel and we'll assist you.

Submit it with all requirements as an assignment to our control panel and we'll assist you.

## Comments

## Leave a comment