SmarterEd

Aussie Maths & Science Teachers: Save your time with SmarterEd

  • Login
  • Get Help
  • About

Probability, SMB-015

On a tray there are 12 hard‑centred chocolates `(H)` and 8 soft‑centred chocolates `(S)`. Two chocolates are selected at random. A partially completed probability tree is shown.
 


 

What is the probability of selecting at least one soft-centred chocolate?  (3 marks)

--- 7 WORK AREA LINES (style=lined) ---

Show Answers Only

`62/95`

Show Worked Solution

`P(text{at least one}\ S)`

`= 1-P(HH)`

`= 1-(12/20 xx 11/19)`

`= 1-33/95`

`= 62/95`

♦ Mean mark 45%.

Filed Under: Multi-Stage Events Tagged With: num-title-ct-pathb, smc-4238-10-Dependent events, smc-4238-50-Probability trees, smc-4238-70-Complementary events, smc-4238-80-"at least"

Probability, SMB-014

A game consists of two tokens being drawn at random from a barrel containing 20 tokens. There are 17 red tokens and 3 black tokens. The player keeps the two tokens drawn.

  1.  Complete the probability tree by writing the missing probabilities in the boxes.  (2 marks)
     
     
       

    --- 0 WORK AREA LINES (style=lined) ---

  2.  What is the probability that a player draws at least one red token? Give your answer in exact form.  (2 marks)

    --- 4 WORK AREA LINES (style=lined) ---

Show Answers Only
  1.  
  2. `187/190`
Show Worked Solution
i.   

 

ii.   `P(text(at least one red))`

`= 1-P(BB)`

`= 1-3/20 xx 2/19`

`= 187/190`

Filed Under: Multi-Stage Events Tagged With: num-title-ct-pathb, smc-4238-10-Dependent events, smc-4238-50-Probability trees, smc-4238-70-Complementary events, smc-4238-80-"at least"

Probability, STD2 S2 2009 HSC 27c

In each of three raffles, 100 tickets are sold and one prize is awarded.

Mary buys two tickets in one raffle. Jane buys one ticket in each of the other two raffles.

Determine who has the better chance of winning at least one prize. Justify your response using probability calculations.   (4 marks)  

Show Answers Only
`P(text(Mary wins) )` `= 2/100`
  `= 1/50`

 

`P(text(Jane wins at least 1) )` `= 1-P (text(loses both) )`
  `= 1-99/100 xx 99/100`
  `= 1-9801/(10\ 000)`
  `= 199/(10\ 000)`

 
`text{Since}\ \ 1/50 > 199/(10\ 000)`

`=>\ text(Mary has a better chance of winning.)`

Show Worked Solution
`P(text(Mary wins) )` `= 2/100`
  `= 1/50`

 

`P(text(Jane wins at least 1) )` `= 1-P (text(loses both) )`
  `= 1-99/100 xx 99/100`
  `= 1-9801/(10\ 000)`
  `= 199/(10\ 000)`

 
`text{Since}\ \ 1/50 > 199/(10\ 000)`

`=>\ text(Mary has a better chance of winning.)`

♦♦ Mean mark 31%.
MARKER’S COMMENT: Very few students calculated Jane’s chance of winning correctly. Note the use of “at least” in the question. Finding `1-P`(complement) is the best strategy here.

Filed Under: Multi-Stage Events, Multi-stage Events, Multi-Stage Events (Std 2), Single and Multi-Stage Events (Std 1) Tagged With: Band 5, num-title-ct-pathb, num-title-qs-hsc, smc-1135-20-Other Multi-Stage Events, smc-1135-30-P(E) = 1 - P(not E), smc-4238-70-Complementary events, smc-4238-80-"at least", smc-829-20-Other Multi-Stage Events, smc-829-30-P(E) = 1 - P(not E)

Probability, STD2 S2 2012 HSC 12 MC

Two unbiased dice, each with faces numbered 1, 2, 3, 4, 5, 6, are rolled. 

What is the probability of a 6 appearing on at least one of the dice? 

  1. `1/6`  
  2. `11/36` 
  3. `25/36`  
  4. `5/6`  
Show Answers Only

`B`

Show Worked Solution

`P(text(at least 1 six))`

`= 1-P(text(no six)) xx P(text(no six))`

`=1-5/6 xx 5/6`

`=11/36`
 

`=>  B`

♦♦♦ Mean mark 25%
COMMENT: The term “at least” should flag that calculating the probability of `1-P text{(event not happening)}` is likely to be the most efficient way to solve.

Filed Under: Multi-stage Events, Multi-Stage Events (Std 2), Single and Multi-Stage Events (Std 1) Tagged With: Band 5, num-title-ct-pathb, num-title-qs-hsc, smc-1135-20-Other Multi-Stage Events, smc-1135-30-P(E) = 1 - P(not E), smc-4238-70-Complementary events, smc-4238-80-"at least", smc-829-20-Other Multi-Stage Events, smc-829-30-P(E) = 1 - P(not E)

Copyright © 2014–2025 SmarterEd.com.au · Log in