Minimum number of common elements in sets

kamarala
Messages
2
Reaction score
0
Hello,

Let's say I have 500 boxes and 500 hundred non-identical items.

I would like to have sets of 40, chosen among those 500 hundred items and my objective is to keep the number of same items in any 2 boxes at a minimum.

1. What would be that minimum number of common items?

2. If it's not easy to calculate, could someone suggest an algorithm. I can write little php, so I may try to get it calculated.

Thanks in advance.

p.s. I'm asking it here, hoping that someone smarter than me could come up with a quick way to calculate it. Of course, I'm not expecting anyone to spend much time on it to solve it for me, but it would nice to know if there are no short-cuts to calculate it.
 
Physics news on Phys.org
So some of the 500 items are identical, but not all of them? How many of each identical set are there?
 
nonvestigial said:
So some of the 500 items are identical, but not all of them? How many of each identical set are there?

Hmm, I think I was not clear enough, my bad.

I have unlimited quantity of each item. I would like to fill in the boxes with 40 items and I would like to keep the number of common items in any box to a minimum.

Like, I have 500 different gifts (with unlimited quantity) to choose from and I would like to prepare gift boxes for children and I will put 40 gifts in each of them. I want to keep the boxes that any 2 children gets as different as possible.

I hope I could make it clear.

Edit: And there are a total of 500 boxes / children.
 
Last edited:
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top