Given two coins which have probability of getting heads p% and q% respectively, the task is to determine the probability of getting two consecutive heads after choosing random coins among the given coins.
Input: p = 33, q = 66
Input: p = 33, q = 66
Since both the coins are not identical so Bayes’s theorem will be used to get the desired probability.
As the coins are to be chosen randomly then any of them can be chosen so p and q will be included in the calculation. After applying Bayes’s theorem, the required answer will be (p * p + q * q) / (p + q) because if the first coin is chosen then the probability of getting both heads back to back is p * p and same for the second coin.
It’s an application of Bayes’ theorem.
P(B | A) = P(A |^| B) / P(A) = (1/2 * p * p + 1/2 * q * q) / (1/2 * p + 1/2 * q) = (p * p + q * q) / (p + q) where;
P(B) = probability to get heads on the second throw,
P(A) = probability to get heads on the first throw and
P(A |^| B) = probability to get heads on both the throws.
So, P(B | A) is the probability to get heads on the second throw if we are given that we got heads
on the first one.
Here A, B denotes 1st and 2nd coin.
Below is the implementation of above approach:
- Probability of getting at least K heads in N tosses of Coins
- Probability of getting more heads than tails when N biased coins are tossed
- Probability of choosing a random pair with maximum sum in an array
- Expected number of coin flips to get two heads in a row?
- Select a Random Node from a tree with equal probability
- Probability that a random pair chosen from an array (a[i], a[j]) has the maximum sum
- Random number generator in arbitrary probability distribution fashion
- Probability of a random pair being the maximum weighted pair
- Make a fair coin from a biased coin
- Test Case Generation | Set 2 ( Random Characters, Strings and Arrays of Random Strings)
- Maximize sum by choosing elements from different section of a matrix
- Count ways of choosing a pair with maximum difference
- Coin Change | DP-7
- Number of ways of choosing K equal substrings of any length for every query
- Coin Change | BFS Approach
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.