This article will summarize the work of different people in trying to solve different types of Texas Hold'em Poker, specifically cash limit games and no-limit tournaments.
Let S be the set of n-tuples A=(a_1, a_2, ..., a_n) such that a_i >=0. A summation question and solution.
A presentation of a solution and generalization of the friends problem through the use of random variables, probability distributions, and expectation.
Johnny has a bag of marbles with n red marbles and n blue marbles. What is the probability that he goes through the entire bag before stopping?
An introduction to conditional probability and the most important theorems relating to it. At the end, there are interesting problems to try and solutions.
Solutions to the Conditional Probability Problem Set