Probability of matching n words with n pictures correctly

BifSlamkovich
Messages
23
Reaction score
0
Suppose there are n pictures and n words. Each word matches with exactly one out of the n pictures. What is the probability function of having exactly y words match up correctly?
 
Physics news on Phys.org
Depends on how the words and pics getting sorted?
Write the words on cards, stack, shuffle, and deal them out between the pics?
The first card has a 1/n chance of being next to the right picture - but, if it is wrong, then another card is guaranteed to be next to a wrong picture. That will be your problem.

Anyway - this sort of thing is commonly described as seating dinner guests against their place-cards.
 
Simon Bridge said:
Depends on how the words and pics getting sorted?
Write the words on cards, stack, shuffle, and deal them out between the pics?

Yes.
 
Simon Bridge said:
Depends on how the words and pics getting sorted?
Write the words on cards, stack, shuffle, and deal them out between the pics?
The first card has a 1/n chance of being next to the right picture - but, if it is wrong, then another card is guaranteed to be next to a wrong picture. That will be your problem.

Anyway - this sort of thing is commonly described as seating dinner guests against their place-cards.

Do you know the solution? I can write one, but mine gets more complicated as n increases.]

Edit: Can you use the hypergeometric distribution to get the answer?
 
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