Hello, konix!

I hope this wasn't a homework problem.

The theory required is quite advanced.

. . In fact, I won't into the details here . . .

(i) The first card can be any card: .You have 2 standard 52 card decks of cards that have been shuffled randomly.

You turn over the first card from the first deck, and the first card from the second deck.

(i) What is the probability they match?

(ii)You keep turning over the top card on each deck, until you have gone through

the whole deck. How many matches do you expect to find?

(iii) You have a thousand letters and envelopes addressed to people,

the envelopes get mixed up and the letters get randomly put into envelopes.

How many do you expect to end up in the right envelope?

. . .The other card must match: .

The probability that the two top cards match is: . . You were right!

{ii) and (iii) This is a classic (very old) problem.

It has been called "The Mis-addressed Envelopes" or "The Careless Hatcheck Girl".

(Make up your own scenarios.)

A permutation of objects in whichnoobject is in its proper place

. . is called a "complete permuatation" or, more commonly, adisarrangment.

You might try to discern a pattern, but it's very elusive . . .

. . .

With a deck of 6 cards, there are 6! = 720 possible orders for the first deck.

There are 265 orders for the second deck to havenomatches.

Hence, there are: . orders withsomematch.

Therefore: .

With 52 cards, we need the number of possible disarrangements,

. . and divide by 52!, the number of possible orderings of the cards.

This is the probability ofnomatches.

. . Subtract from one (1), to get the probability ofsomematches.

Skipping all the underlying theory, as the number of objects gets larger,

. . the probability of getting no matches approaches

Maybe you can apply all this to your problem . . .

Edit: I was reminded that the proper term isderangement

. . . . That's true . . . *sigh*