0
$\begingroup$

Context

I understand this proof and it is quite slick and throws up a counterintuitive result.

However, before looking at the solution, I tried my own ham-fisted approach of finding P(AoS immediately drawn after first ace), and wasn't sure where my mistake is.

Finding number of orderings s.t. AoS follows first ace.

$$\text{Let } A_1 = \text{first ace, which is not ace of spades}$$

$$\text{Let } A_s = \text{ace of spades} $$

Scenario 1: A_1 and A_s drawn first:

$$\text{A_1, A_s, ... = 50!*3 orderings (3 choices for A_1)}$$

Next scenarios:

$$\text{[X],} A_1, A_s, ... \text{ where [X] is a card other than an ace = 48*49!*3} \text{ orderings.}$$

$$\text{[X], [X]}, A_1, A_s ... = \frac{48!}{(48-2)!} * 48! * 3 \text{ orderings.}$$

...

Final scenario:

$$\text{[X], [X] ... [X],} A_1, A_s ... = \frac{48!}{(48-48)!}*2!*3$$

Sum these terms up. A general term can be written as:

$$\frac{48!}{(48-r)!} * (50 - r)! *3 = \frac{48!}{(48-r)!} * (48 - r)! * 49 * 50 *3 = 50! * 3 $$

Summing 49 of these terms would lead to an answer of 147*50!, which is not what the author had for the number of orderings that verify this event (51!).

What's gone wrong with my reasoning?

$\endgroup$
8
  • $\begingroup$ Why other than an ace in the second line? You could even have all the aces together. And why go for a more cumbersome proof where there are more chances of error when a simple proof satisfies you ? Anyway, always remember the dictum "Cards don't have preference for positions." $\endgroup$
    – true blue anil
    Commented Mar 22, 2021 at 15:32
  • $\begingroup$ Otherwise the AoS wouldn't be directly after the first ace? My idea was to write an exhaustive list of all possible orderings that verify the event 'AoS after first ace' just to test my understanding of combinatorics (ik the author's sol is v slick, but I tried this before reading the solution). $\endgroup$
    – threelinewhip
    Commented Mar 22, 2021 at 17:55
  • $\begingroup$ And since I'm working out number of orderings that verify the event and divide this by total orderings (although I guess you can work this out with an unordered approach - nevertheless, an ordered approach can work as well), then cards would have a preference for position? $\endgroup$
    – threelinewhip
    Commented Mar 22, 2021 at 17:55
  • $\begingroup$ Well, if you are counting, fine, I just meant that you should keep that dictum in mind for a possibly simpler approach for many problems. $\endgroup$
    – true blue anil
    Commented Mar 22, 2021 at 18:14
  • $\begingroup$ Doesn't the author's slick solution make use of orderings? (51!) $\endgroup$
    – threelinewhip
    Commented Mar 22, 2021 at 18:17

0

Reset to default

You must log in to answer this question.