I'm triyng to find an answer for this qustion...
Lets say I have a range of {0, 1, ... , r} numbers, where I need to choose sub range of n size, which I want to divide into k equal size lists. I can use the same value multiple time, and the order isnt important.
The condition is that after the partition, each m lists (from the total k) must contains all values, and there isn't any m-1 lists that holds this condition.
My question is how I can find the maximum n value that can performs this procedure?