Probability Theory... little help

I’ve been trying to learn probability and other math from books and from online tutorials. It’s a little hard to ask questions because I don’t understand the topic yet. This is my attempt…

Let’s say that there are four cards: w,x,y,z but only the exact combination, w,x,y,z is winning. (w,x,z,y ; x,w,z,y etc. are losing combinations.)

Using the factorial function, (4! = 24) for the total number of possible combinations and (0! = 1) for the number of ‘winning’ combinations, the odds of getting the ‘winning’ combination is 1 : 24.

Now, if one need only get three of the four to be ‘right,’ it would seem the odds would be better. However, the odds are the same. (0! = 1 = 1!) The combinations, w,x,y,* and * ,x,y,z are logically equivalent to * w,x,y,z*.

The real complication for me comes if one need only get two or fewer cards right. If, by two right you mean: * w,x,*,**, then (2! = 2) there are two winning combinations. Likewise, if one need only get one card right then (3! = 6) the odds are 6 : 24. (FWIW, I had to verify all of this for myself with fingers and toes math.)

But, if by two you mean any two: (w,x,,* ; ,x,y, ;* or ,,y,z ) or if by one * you mean * any * one: (w,,,* ; ,x,,* ;** ,,y,* * or **,,,z * then the logical equivalents throw a wrench into the factorial machine.

Any two gives you 4 : 24. (**,x,y,* * --> 2! = 2 but one of those combinations was already counted in the equation: w,x,,* * --> 2! = 2. (i.e.: w,x,y,z ) Since the same is true for **,,y,z, the total is (2! + (2! - 1) + (2! - 1)) = 4. ( I’m working on the assumption that while I might have the right answer, I may have brought in the factorials where they don’t belong.)

My question is, what is the ‘generic’ or theoretical equation used to give you the ‘winning’ combinations in the case of any one or two? What would really help would be the “a^2 + b^2 = c^2” answer… or better yet, the “pythagorean theorem” answer, not 9 + 16 = 25.

Explaining that you just finished teaching your friend, Joe that the answers are four and fifteen respectively and that your friend, Joe is your 12 year old, paralyzed, lobotomized cocker spaniel who can only communicate by blinking his left eye will not help.

Anything I could use to search wolfram or similar sites to find instruction on this type of problem would really help!

First off, a slight nitpick: If the probability of an event happening is 1/24, then the odds are 23:1. Basically, probability is the count of favorable events divided by the count of all possible events, and odds are the count of favorable events compared to the count of unfavorable events.

Now then…

You’re right in thinking that the probability of getting w, x, y, z is 1/24, but 0! has nothing to do with it. There’s 1 favorable outcome and 24 possible ones, so that’s where you get 1/24.

If w, x, y and z are the only possible cards, and you know where three of them fell, then you know where the fourth is as well. So the probability of getting three right is still 1/24.

Two cards is a little more complicated. There are two sequences with w, x; two with x, y; and two with y, z. The complication here is w, x, y, z accounts for half of each of those figures, so you need to subtract out all but one of the occurences (or all of them, if you want to know the probability of getting exactly two cards right). So I get 4/24 for the probability of getting at least two the cards right, and 3/24 for the probability of getting exactly two cards right.

One card is even more complicated, so I’m going to use a shortcut. So far there are 4 outcomes where more than one card is right. Because I know about derangements, I know that there are 9 outcomes where no card is in its proper position. So it follows that there are 11 distinct outcomes where exactly one card is in the right position.

Unfortunately, there’s no royal road to learning this sort of stuff. You just have to do a lot of problems and spend some time understanding the right answers.

i.e. 23 to 1 against, or 1 to 23 in favor.

Another slight nitpick, or perhaps a warning: In the contexts of probability and combinatorics (= counting how many arrangements, etc. are possible), the word “combinations” has a specific meaning that is different from the way you used it in the OP (and from the way the word is often used in ordinary speech). Specifically, combinations are the different ways you can select r objects if you have n to choose from and the order in which you select them does not matter (as opposed to permutations, in which order is significant).

I would have said 7, out of 24

But 0! is 1.

I think you forgot the three combinations with w,y right; w,z right; and x,z right.

8, by my count

Not quite. For simplicities sake , let’s use numbers so the ordering principles are a little more clear. Fair warning, it has been more than 2 decades since I studied probability theory.

1 2 3 4
1 2 4 3
1 3 2 4
1 3 4 2
1 4 2 3
1 4 3 2
2 1 3 4
2 1 4 3
2 3 1 4
2 3 4 1
2 4 1 3
2 4 3 1
3 1 2 4
3 1 4 2
3 2 1 4
3 2 4 1
3 4 1 2
3 4 2 1
4 1 2 3
4 1 3 2
4 2 1 3
4 2 3 1
4 3 1 2
4 3 2 1

So, the number of winning combinations is 7. 6 cases in which exactly 2 “cards” are in the correct position, and 1 case in which all four cards are in the correct position (as you note, exactly 3 cards in order yields the same case as exactly 4 cards in order). The key word here is “combinations”.

The number of sequences in which exactly k cards are in the right position is equivalent to the number of ways for us to choose k cards from the ordered sequence (1 2 3 4). C[sub]4,2[/sub] = 4!/(2!*(2)! = 24/4 = 6. Let’s call that E[sub]2[/sub] for convenience.

The number of sequences in which two or more cards are in proper order = E[sub]2[/sub] + E[sub]4[/sub] + E[sub]4[/sub] = 6 + 0 + 1 = 7.

Unfortunately, I know of no generalized formula to abtract this to larger sets. I know that it is not possible to have exactly 3 cards in position. I know that if I chose any 2 out of 4 cards to be correct (order unimportant) it yields 2 permutations: one in which teh remaining cards are ordered, one in which they are not. If the remaining cards are ordered, then all four cards are in order so we do not have exactly 2. Thus, C[sub]4,2[/sub]*(P[sub]2,2[/sub]-1) reduces to C[sub]4,2[/sub] = 6. For exactly 1 correct card the number of possible permutations after the choice is 6, with three arrangements in which exactly one of the remaining :cards" is correct and on in which all are correct.

C[sub]4,4[/sub] = 1
C[sub]4,3[/sub](P[sub]1,1[/sub]-1) = 0
C[sub]4,2[/sub]
(P[sub]2,2[/sub]-1) = 6
C[sub]4,1[/sub]*(P[sub]3,3[/sub]-3-1) = 8

I know of no way to generalize a formula, though.

But why is that relevant here?

That’s true. So 6 combinations with exactly two cards right, 1 with exactly four cards right, and 9 with no cards right. Makes 8 with one card right.

I have a lot to look over here and in the derangements link. I think I may be confusing a couple of issues. When i started though, the idea was that w,x,y,z had to be in that order. I pictured a nail driving them into the table. No card can “move.”

Next, I thought, if one card has no nail, it can move, then You have 1!.

If none can move, then you must have zero.

Tahnks everyone, this is really what I was looking for.

Yes, I was off on this. Interestingly, it was figuring out why I was off that helped me figure out a few things. (I also realized that any two isn’t exactly what I meant. I meant {w,x,,} or {,x,y,} or {,,y,z}.)

Another problem that pushed me was the issue of there being nine “permutations” (I hope I’m using the right word) where no card is in the right place. If there are 24 total - 9 “incorrect” then there are 15 permutations (24 - 9 = 15) where at least one card is in the ‘right’ place.

I couldn’t find any cite, so the only thing I can do is to try to reproduce my ‘fingers-and-toes.’ I apologize in advance for my banality. I really am trying to learn this stuff.

I think 0! has a lot to do with it and this is why:

First, I decided to write out all the permutations of {w,x,y,z}. I made a chart with four column titles: w (3!), x (3!). y (3!). z (3!). Each card can be the first card leaving (3) cards that can be in any order.
The rows I simply number 1-6 because (3!) = 6. There are four cards, six permutations each, 6 * 4 = 24.

Next, I highlighted those nine permutations with no card in the right position. It was a little surprising to note that none of the nine were in the first column until I realized that the first column is {w,,*,**} so every permutation there definitely has one card in the right position: {w1}.

I then physically checked the remaining permutations. All fifteen have at least one card in the right position: {w1, x2, y3, z4} where the subscript, in this case, indicates the position of the card.

The difference between the sets: {w,x,y,z} and {w1,x2,y3,z4} is that {w1,,,} accounts for certain permutations in {,x2,,}, namely {w1,x2,,}, and likewise for {y3} etc.

If, instead of physically finding those permutations that have already been used, one counts the permutations where {w,x,y,z} = (0!) and {w,x,y,};{,x,y,z};{w,,y,z*};{w,x,,z*} = (1!) etc. ( using factorial for the number of “holes” or “wild-cards”) then the logically equivalent permutations can be subtracted.

In that case, one can use the equation: ((3!) + (3!-2!) + (3! - (2! + 1!) + (3! - (2! + 1! + 0!)) = 15. This is the same as: {w,,,} + ({,x,,} - {w,x,,}) + ({,*,y,} - ({w,,y,} + {*w,x,y,})) + ({**,,,z*} - ({w,,,z} + {w,,y,z*} + {w,x,y,z})).
I hope I got all the () and {} in the right places.

I haven’t gotten that far yet, but I think this can be used with larger sets and other “combinations” as well. (e.g.: {w,x,,} or {,x,y,} or {,,y,z} --> 2! + (2! - 1!) + (2! - 0!) = 4. (I checked this answer against the chart and there are 4 permutations that fit the criteria.)

Sorry it took me so long to get all of this together and posted.
I thought it made more sense to post in this thread rather than start a new one.