Number of possible Straights in a deck of 52 cards

  • Thread starter Thread starter audifanatic51
  • Start date Start date
  • Tags Tags
    Cards
AI Thread Summary
The discussion revolves around calculating the number of possible straights in a standard 52-card deck. The original poster mistakenly believes that selecting one card and restricting the next four cards to one suit is the correct approach. However, it is clarified that there are 14 effective ranks for straights, allowing for 10 different starting sequences, with each card in the sequence being able to be of any of the four suits. The total number of straights is calculated as 10 multiplied by 4 raised to the power of 5, resulting in 10,240 possible straights, with 40 being straight flushes. The key point is that the first card's position in the sequence affects the calculation, emphasizing the need for consistency in defining the sequence.
audifanatic51
Messages
10
Reaction score
0
Hi,

I'm a bit thick-headed I guess and I cannot seem to figure out why my answer to this question is wrong.

I need to figure out the number of ways to obtain a straight in a deck of 52 cards (I do not need to ignore straight-flushes or royal flushes).

Note: a hand of 5 cards is used

My answer was to choose 1 card from a deck of 52 cards and then restrict the next 4 cards to one of 4 possible cards (one for each suit).

So, in short:

52C1 * (4C1)^4

which is wrong. Can anybody explain to me why I am wrong. I'm a-Ok with calc 1-4 and graph theory, but counting theories have never been by favorite, even as a kid. Thanks for the help
 
Physics news on Phys.org
"There are 14 effective ranks of cards for a straight (ace can be high or low). The straight can start on anyone of A,K,J,Q,T,9,8,7,6,5 and go down. That makes 10 base straight sequences. Each card in the sequence can be any of the four suits. So the total number of straights is 10 * 4 ^5 = 10240.

40 of those are a straight flush." -Wiki answers.
 
audifanatic51 said:
My answer was to choose 1 card from a deck of 52 cards and then restrict the next 4 cards to one of 4 possible cards (one for each suit).

So, in short:
52C1 * (4C1)^4
You appear to be taking that first card as the top (or maybe the bottom, but not either/or) of the run. As FeynmanIsCool points out, only 40 of the cards can serve as that.
 
haruspex said:
You appear to be taking that first card as the top (or maybe the bottom, but not either/or) of the run. As FeynmanIsCool points out, only 40 of the cards can serve as that.

Ok, you you're basically saying that there really isn't a "first" card since that "first card" can be at the top, end, or somewhere in the middle since order doesn't matter?
 
audifanatic51 said:
Ok, you you're basically saying that there really isn't a "first" card since that "first card" can be at the top, end, or somewhere in the middle since order doesn't matter?
No, I'm saying that if you are taking the first card to define the set of four others then you need to specify where in the sequence that first card comes. You can make it the top, the bottom, or anywhere in between provided you are consistent. But once you have fixed that, there are only forty cards it can be.
 
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