Odds of being dealt 'AA' 3 times in a row in texas hold'em

  • Thread starter Thread starter bozo the clown
  • Start date Start date
  • Tags Tags
    Row
bozo the clown
Messages
93
Reaction score
0
What are the odds of being dealt 'AA' 3 times in a row in texas holdem.
 
Mathematics news on Phys.org
It would depend upon which layer you are and what other players got-- odds could be dependent on how you calculate them
for example if you were first player and you got A it owuld be 4/52 but if you were second player and the first player got A it would be 3/51 if first player got A but 4/51 if they did not.

From complete blind odds- a calculation could be done but I am too tired for ACT to do that now
 
McCurdy is wrong. Since all the other cards are hidden, the probability of AA is (4x3)/(52x51) for anyone hand. The probability for 3 times in a row is that no. cubed. If you are talking about a long sequence of hands, the probability of 3 in a row some time is more complicated.
 
my method implied a little cheating :)

hey don't pretend it doesn't happen in cards
 
I I am talking about 'pocket aces' the 2 cards each player is dealt at start of round now the odds of being dealt 2 aces is 1 in 222 therefore
222*222*222 = 10,941,048 - 1 am I correct

so I basically did the equivalent of winning a small fortune on the lottery except all I won was about $50
 
Minor quibble. According to my calculation, the odds are 1 in 221, not 222.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top