I am currently planning a bar crawl and could use some help. There are 6 groups and 6 bars. Each group will start at a different bar (Stop 1). Each group will then meet up with a different group at Stop 2, Stop 3, etc., totaling 6 stops. Each group will need to meet each other group one time. Ideally, no group would repeat a bar, ie. each group will meet each other group and hit all 6 designated bars. I've been trying to manually chart this and I'm pulling my hair out. Is there a way to figure this out with math or some other voodoo that I'm not aware of?
How many unique ways are there to put X rocks into Y boxes? (Given two different sets of attributes for both the rocks and the boxes.) [more inside]
36 people total, meeting in groups of 6. After 5 minutes, the groups shuffle into completely new groups. How many "rounds" can we go without people meeting with someone they've already met? [more inside]
I've annoyed myself by getting stuck attempting to work out a silly maths problem relating to permutations. It's an extension of the 'how many odd socks do I have to pull out of a drawer before I find a pair' problem. Only my theoretical sock-wearer has three legs. And a penchant for odd socks. [more inside]
I have a math question involving combinations and sets. [more inside]
Is there a standard ball picking algorithm? I have 10 balls that I want put in four boxes (A-D). Every box can hold zero to all balls. [more inside]
Suppose there's a web form with 50 checkboxes (representing options or interests), and that checking one has no effect on any of the others. A user could select any two boxes, or a half dozen, or a different half dozen, or all 50. The only constraint on the form submission is that the user must check at least two boxes. How many possible combinations are there? [more inside]