## Problem Solving : Tossing/Throwing/Flipping coins |

## Problem Solving : Tossing/Throwing/Flipping coins |

## Tossing multiple coins is the same as tossing a coin multiple times |

In the experiment of tossing two or more coins, the act of each coin getting tossed is independent of the other coins getting tossed i.e. what appears on a coin is independent of what appears on the other coins.

The outcomes of the experiment of tossing two or more coins would be the same as the outcomes of the experiment of tossing a coin multiple times.

- Tossing the coin the first time would represent tossing the first coin.
- Tossing the coin a second time would represent, tossing the second coin.
- ...
- Tossing the coin for the n
^{th}time would represent, tossing the n^{th}coin.

Therefore, in problem solving the experiment of tossing 'n' coins and the experiment of tossing a coing 'n' times should be viewed as the same.

## Total number of possible choices in tossing coins |

The total number of possible choices in tossing a single coin is two, i.e. the elementary event of getting a head and the elementary event of getting a tail.

The experiment of towsing 'n' coins (or tossing a coin 'n' times), consists of 'n' independent trials of tossing a coin. The trials are independent since a coin showing up heads or tails is not dependent on what appears on the other coins.

To find the number of possible choices in tossing 'n' coins, we divide the event of tossing 'n' coins into 'n' independent events of tossing a coin each.

E : Tossing 2 Coins | |

E_{1}Tossing the 1 ^{st} Coin | E_{2}Tossing the 2 ^{nd} Coin |

Total number of possible choices in tossing 2 coins

= | No. of possible events/choices in tossing the 1^{st} coin × No. of possible events/choices in tossing the 2 ^{nd} coin | |

⇒ n(E) | = | n(E_{1}) × n(E_{2}) |
---|---|---|

= | 2 × 2 | |

= | 2^{2} |

E : Tossing 3 Coins | ||

E_{1}Tossing the 1 ^{st} Coin | E_{2}Tossing the 2 ^{nd} Coin | E_{3}Tossing the 3 ^{rd} Coin |

Totall number of possible choices in tossing 3 coins

= | No. of possible events/choices in tossing the 1^{st} coin × No. of possible events/choices in tossing the 2 ^{nd} coin × No. of possible events/choices in tossing the 3 ^{rd} coin | |

⇒ n(E) | = | n(E_{1}) × n(E_{2}) × n(E_{3}) |
---|---|---|

= | 2 × 2 × 2 | |

= | 2^{3} |

E : Tossing n Coins | |||

E_{1}Tossing the 1 ^{st} Coin | E_{2}Tossing the 2 ^{nd} Coin | ... | E_{n}Tossing the n ^{th} Coin |

Totall number of possible choices in tossing n coins

= | No. of possible events/choices in tossing the 1^{st} coin × No. of possible events/choices in tossing the 2 ^{nd} coin × ... n times | |

⇒ n(E) | = | n(E_{1}) × n(E_{2}) × ... × n(E_{n}) |
---|---|---|

= | 2 × 2 × ... n times | |

= | 2^{n} |

Thus, the total number of possible choices in tossing

- 4 Coins = 16 (2
^{4}) - 5 Coins = 32 (2
^{5}) - 6 Coins = 64 (2
^{6}) - ...

## Throwing/Tossing/Rolling Two/Three coins - Favorable/Favourable choices for events |

Listing out all the possible outcomes using symbols representing each possibility would be an easy way to find both the total number of possible choices as well as the number of favorable/favourable choices in relation to an experiment. If we are able to list the total possible choices, then the favourable choices would be none or more of those. This method can be adopted only where the total number of possible choices is small and there is no other simpler/convenient method available. Say for the experiment of tossing two, three or atmost four coins. ### Two Coins

### Three Coins

### Four Coins

Where the number of coins involved is greater than three it would be convenient to follow the next method.

We use 'H' or 'T' to represent a head and tail respectively in relation to a coin.

The Word Form

- HT represents a head on the 1
^{st}and tail on the 2^{nd}coins respectively. - HTH represents a head on the 1
^{st}, a tail on the 2^{nd}and a head on the 3^{rd}coins respectively.

Total number of possible choice = 4 {HH,HT,TH,TT}

Number of favorable choices for the event of getting

- both heads = 1 {HH}
- a head and a tail = 2 {HT, TH}
- atleast one head = 3 {HH, HT, TH}

Total number of possible choice = 8 {HHH, HHT, HTH, HTT, THH, THT, TTH, TTT}

Take the elements in the set representing the possible choices for two coins, prefix each element with 'H' to derive 4 choices and 'T' to derive another 4 choices.

Number of favorable choices for the event of getting

- two heads = 3 {HHT,HTH,THH}
- atleast a head and a tail = 6 {HHT, HTH, HTT, THH, THT, TTH}
- all tails = 1 {TTT}

Total number of possible choice = 16

{THHH, THHT, THTH, THTT, TTHH, TTHT, TTTH, TTTT,

HHHH, HHHT, HHTH, HHTT, HTHH, HTHT, HTTH, HTTT}

HHHH, HHHT, HHTH, HHTT, HTHH, HTHT, HTTH, HTTT}

Take the elements in the set representing the possible choices for three coins, prefix each element with 'H' to derive 8 choices and 'T' to derive another 8 choices.

Number of favorable choices for the event of getting

- two heads = 6 {THHT, THTH, TTHH, HHTT, HTHT, HTTH}
- atleast three heads = 6 {THHH, HHHH, HHHT, HTHH}
- all tails = 1 {HHHH}

## Tossing/Throwing/Rolling four or more coins - Favorable/Favourable choices for events |

The total number of possible choices = (2)^{(Number of Coins)}

This relation can be used for the experiment involving any number of coins.

Let

A : The event of getting three heads

Word form representing the event - HHHT

In the word form

L | = | Number of letters |
---|---|---|

= | 4 {H, H, H, T} | |

L_{(a)} | = | Number of H's [Letters of the first kind] |

= | 3 | |

L_{(b)} | = | Number of T's [Letters of the second kind] |

= | 1 | |

L_{(x)} | = | Number of Others [Letters which are all different] |

= | 0 | |

L | = | L_{(a)} + L_{(b)} + L_{(x)} |

Number of Favourable/Favorable Choices

= | Number of arrangements possible with the word form representing the required event. | ||||||||

⇒ m_{A} | = |
| |||||||
---|---|---|---|---|---|---|---|---|---|

= |
| ||||||||

= |
| ||||||||

= | 4 |

verification : {HHHT, HHTH, HTHH, THHH}

Since L = L_{(a)} + L_{(b)},

- L
_{(a)}= L − L_{(b)}

(Or) - L
_{(b)}= L − L_{(a)}

Therefore,

| = |
| ≡ |
| ||||||

= | C(L, L_{(a)}) | ≡ | C(n, r) | |||||||

= | C(Number of Coins, Number of Heads) | |||||||||

(Or) | = |
| ||||||||

= | C(L, L_{(b)}) | |||||||||

= | C(Number of Coins, Number of Tails) |

Taking the lesser of heads or tails would minimise the calculations.

- A : The event of getting two heads
##### • For Event "A"

Number of Favourable/Favorable Choices= C(Number of Coins, Number of Heads) = C(5, 2) = 5 × 4 2 × 1 = 10 - B : The event of getting atleast four tails
##### • For Event "B"

Event 'B' can be accomplished in two alternative ways- B
_{A1}: getting 4 tails - B
_{A2}: getting 5 tails

###### • For Event "B

_{A1}"Number of Favourable/Favorable Choices= C(Number of Coins, Number of Heads) = C(5, 1) = 5 1 = 5 verification : {HTTTT, THTTT, TTHTT, TTTHT, TTTTH}

##### • For Event "B

_{A2}"Number of Favourable/Favorable Choices= C(Number of Coins, Number of Heads) = C(5, 0) = 1 verification : {TTTT}

Number of Favourable/Favorable Choices

= Sum of Favourable/Favorable Choices for the alternatives ⇒ m _{B}= m _{B(A1)}+ m_{B(A2)}= 5 + 1 = 6 - B

- "F" : The event of getting five heads
##### • For Event "F"

Number of Favourable/Favorable Choices= C(Number of Coins, Number of Tails) = C(8, 3) = 8 × 7 × 6 3 × 2 × 1 = 56

Related Show Show All |

- Problems Solutions

## Getting atleast/atmost the specified number of heads/tails in tossing multiple coins |

If the event whose probability or odds is required to be found out may be an event with alternative possibilities, the total number of favorable choices for the event would be the sum of the favourable choices for its alternatives. ### atleast (≥)

Atleast 'x' includes anything equal to or greater than x. ### atmost (≤)

Atmost 'x' includes anything equal to or less than x. ### Using Complimentary Events

In cases where we find the terms atleast and atmost and where the number of alternatives for the events are many, we may be able to minimise the calculations by using event complements. #### atleast "x"

#### atmost "x"

Such events can be identiifed by the presence of the phrases atleast or atmost in the event definitions. Using mathematical operators they can be interpreted as

- Getting atleast 4 heads on tossing 6 coins.
**Experiment**: Tossing 6 CoinsA : The event of getting atleast 4 heads

#### • For Event "A"

atleast 4 heads ≡ 4 or more headsEvent 'A' can be accomplished in three alternative ways.

- A
_{1}: The event of getting 4 heads - A
_{1}: The event of getting 5 heads - A
_{3}: The event of getting 6 heads

Number of Favourable/Favorable Choices

= Sum of Number of Favourable/Favorable Choices for the alternatives ⇒ m _{A}= m _{A(1)}+ m_{A(2)}+ m_{A(3)} - A

- Getting atmost 3 tails on tossing 6 coins.
**Experiment**: Tossing 6 CoinsG : The event of getting atmost 3 tails

#### • For Event "G"

Atmost 3 tails ≡ 3 or less tailsEvent 'G' can be accomplished in four alternative ways

- G
_{1}: The event of getting 3 tails - G
_{2}: The event of getting 2 tails - G
_{3}: The event of getting 1 tail - G
_{4}: The event of getting 0 tails

Number of Favourable/Favorable Choices

= Sum of Number of Favourable/Favorable Choices for the alternatives ⇒ m _{G}= m _{G(1)}+ m_{G(2)}+ m_{G(3)}+ m_{G(4)} - G

- atleast (≥) and less than (<) are complements of each other.

Total number of possible choices= Favorable/favourable choices for atleast

+ Favorable/favourable choices for less than⇒ n = m _{(≥)}+ m_{(<)}Therefore,

**m**= n − m_{(≥)}_{(<)} - atmost (≤) and more than (>) are complements of each other.

Total number of possible choices= Favorable/favourable choices for atleast

+ Favorable/favourable choices for less than⇒ n = m _{(≤)}+ m_{(>)}Therefore,

**m**= n − m_{(≤)}_{(>)}

In cases involving atleast, where the value of 'x' is nearer to zero i.e. farther to number of trials in the experiment, it would be easier to find the number of favorable choices using complementary of the required event.

- Getting atleast 2 heads on tossing 6 coins.
**Experiment**: Tossing 6 CoinsD : The event of getting atleast 2 heads

#### • For Event "D"

atleast 2 heads ≡ 2 or more headsEvent 'D' can be accomplished in five alternative ways

- D
_{1}: The event of getting 2 heads - D
_{2}: The event of getting 3 heads - D
_{3}: The event of getting 4 heads - D
_{4}: The event of getting 5 heads - D
_{5}: The event of getting 6 heads

Number of Favourable/Favorable Choices

= Sum of Number of Favourable/Favorable Choices for the alternatives ⇒ m _{D}= m _{D(1)}+ m_{D(2)}+ m_{D(3)}+ m_{D(4)}+ m_{D(5)}#### Using Complements [≥ and <]

- D : The event of getting atleast 2 heads
- D
^{c}: The event of getting less than 2 heads

##### • For Event "D

^{c}"Event 'D^{c}' can be accomplished in two alternative ways- D
^{c}_{1}: The event of getting 0 heads - D
^{c}_{2}: The event of getting 1 head

Number of Favourable/Favorable Choices

= Sum of Number of Favourable/Favorable Choices for the alternatives ⇒ m _{D}^{c}= m _{Dc(1)}+ m_{Dc(2)}##### • For Event "D"

Number of Favourable/Favorable Choices= Total Number of possible Choices

- Number of Favourable/Favorable Choices for the event complement⇒ m _{D}= n - m _{Dc} - D
- Getting atleast 1 tail on tossing 5 coins.
**Experiment**: Tossing 5 CoinsM : The event of getting atleast 1 tail

#### • For Event "M"

atleast 1 tail ≡ 1 or more tailsEvent 'M' can be accomplished in five alternative ways

- M
_{1}: The event of getting 1 tail - M
_{2}: The event of getting 2 tails - M
_{3}: The event of getting 3 tails - M
_{4}: The event of getting 4 tails - M
_{5}: The event of getting 5 tails

Number of Favourable/Favorable Choices

= Sum of Number of Favourable/Favorable Choices for the alternatives ⇒ m _{D}= m _{M(1)}+ m_{M(2)}+ m_{M(3)}+ m_{M(4)}+ m_{M(5)}#### Using Complements [≥ and <]

- M : The event of getting atleast 1 tail
- M
^{c}: The event of getting less than 1 tails i.e. zero tails i.e. all heads

##### • For Event "M

^{c}"Number of Favourable/Favorable Choices= 1 {HHHHH} ⇒ m _{M}^{c}= 1 ##### • For Event "M"

Number of Favourable/Favorable Choices= Total Number of possible Choices

- Number of Favourable/Favorable Choices for the event complement⇒ m _{M}= n - m _{Mc} - M

In cases involving atmost, where the value of 'x' is nearer to "n" (number of trials in the the experiment) i.e. farther from zero, it would be easier to find the number of favorable choices using complimentary of the required event.

- Getting atmost 5 tails on tossing 7 coins.
**Experiment**: Tossing 7 CoinsR : The event of getting atmost 5 tails

#### • For Event "R"

atmost 5 tails ≡ 5 or less tails

Event 'R' can be accomplished in six alternative ways- R
_{1}: The event of getting 5 tails - R
_{2}: The event of getting 4 tails - R
_{3}: The event of getting 3 tails - R
_{4}: The event of getting 2 tails - R
_{5}: The event of getting 1 tail - R
_{6}: The event of getting 0 tails

Number of Favourable/Favorable Choices

= Sum of Number of Favourable/Favorable Choices for the alternatives ⇒ m _{D}= m _{R(1)}+ m_{R(2)}+ m_{R(3)}+ m_{R(4)}+ m_{R(5)}+ m_{R(6)}#### Using Compliments [≤ and >]

- R : The event of getting atmost 5 tails
- R
^{c}: The event of getting more than 5 tails

##### • For Event "R

^{c}"Event 'R^{c}' can be accomplished in two alternative ways- R
^{c}_{1}: The event of getting 6 tails - R
^{c}_{2}: The event of getting 7 tails

Number of Favourable/Favorable Choices

= Sum of Number of Favourable/Favorable Choices for the alternatives ⇒ m _{R}^{c}= m _{Rc(1)}+ m_{Rc(2)}##### • For Event "R

^{c}"Number of Favourable/Favorable Choices= Total Number of possible Choices

- Number of Favourable/Favorable Choices for the event compliment⇒ m _{R}= n - m _{Rc} - R
- Getting atmost 7 heads on tossing 8 coins.
**Experiment**: Tossing 7 CoinsV : The event of getting atmost 7 heads

#### • For Event "V"

atmost 7 heads ≡ 7 or less heads

Event 'V' can be accomplished in eight alternative ways- V
_{1}: The event of getting 7 heads - V
_{2}: The event of getting 6 heads - V
_{3}: The event of getting 5 heads - V
_{4}: The event of getting 4 heads - V
_{5}: The event of getting 3 tail - V
_{6}: The event of getting 2 heads - V
_{7}: The event of getting 7 heads - V
_{8}: The event of getting 8 heads

Number of Favourable/Favorable Choices

= Sum of Number of Favourable/Favorable Choices for the alternatives ⇒ m _{D}= m _{V(1)}+ m_{V(2)}+ m_{V(3)}+ m_{V(4)}+ m_{V(5)}+ m_{V(6)}+ m_{V(7)}+ m_{V(8)}#### Using Compliments [≤ and >]

- V : The event of getting atmost 7 heads
- V
^{c}: The event of getting more than 7 heads i.e. 8 heads i.e. zero tails

##### • For Event "V

^{c}"Number of Favourable/Favorable Choices= 1 [HHHHHHHH] ⇒ m _{V}^{c}= 1 ##### • For Event "V

^{c}"Number of Favourable/Favorable Choices= Total Number of possible Choices

- Number of Favourable/Favorable Choices for the event compliment⇒ m _{V}= n - m _{Vc} - V

... 151617 ... |

Site optimized for IE 7, FF 2 and above. ♣ ♣ Copyright © Krishbhavara - 2018