Probability of matching n words with n pictures correctly

AI Thread Summary
The probability of matching n words with n pictures correctly is influenced by how the words and pictures are sorted. The initial card has a 1/n chance of matching with the correct picture, but if it does not, subsequent cards are likely to also match incorrectly. This scenario is likened to seating dinner guests according to their place-cards. The discussion suggests that the hypergeometric distribution can be applied to find the solution, specifically referencing the "Rencontres numbers" for the probability distribution. Understanding this concept is essential for calculating the exact probability of y correct matches.
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?
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top