• Congratulations to the Class of 2024 on your results!
    Let us know how you went here
    Got a question about your uni preferences? Ask us here

HSC 2016 Maths Marathon (archive) (1 Viewer)

Status
Not open for further replies.

InteGrand

Well-Known Member
Joined
Dec 11, 2014
Messages
6,109
Gender
Male
HSC
N/A
Re: HSC 2016 2U Marathon

a) 1/36
b) bit confused here as the game will end as proposed in the question so my answer of sky winning is 1/2 as there are 2 players. (might be wrong).


 

leehuan

Well-Known Member
Joined
May 31, 2014
Messages
5,805
Gender
Male
HSC
2015
Re: HSC 2016 2U Marathon

Basically what InteGrand said. Also your part (a) was fine.
____________________________________
NEXT QUESTION:
Troll time
 

qwert73

Member
Joined
Aug 17, 2015
Messages
141
Gender
Male
HSC
2016
Re: HSC 2016 2U Marathon

A school softball team has a probability of 0.2 of winning a match.
i) Find the probability the team wins exactly one of its first 2 matches
ii) What is the least number of consecutive matches the team must play to be 90% certain that it will win at least one match

hint(you need sum of infinity)
 

davidgoes4wce

Well-Known Member
Joined
Jun 29, 2014
Messages
1,877
Location
Sydney, New South Wales
Gender
Male
HSC
N/A
Re: HSC 2016 2U Marathon

My thinking for question

i) 2C1 x (0.20)^1 x (0.80)^1 = 0.32

ii) I drew a tree diagram for this question and equated the probability of winning at least 0.90 , after losing in 'n' attempts
0.90= 1-(0.80)^n

n=10.32

A minimum number of times to ensure that he has at least a 90% chance of winning, will be 11 times.
 

davidgoes4wce

Well-Known Member
Joined
Jun 29, 2014
Messages
1,877
Location
Sydney, New South Wales
Gender
Male
HSC
N/A
Re: HSC 2016 2U Marathon

I also thought about if you rolled out 2 attempts

your sample space would be :{WW, WL, LW, LL}

The probability of LL= 0.80 x 0.80= 0.64

Your chances of 'winning at least once' after 2 attempts is 0.36

You want to get that probability of losing to be under 0.10, which implies that the probability of winning is at least once is 0.90 after 11 attempts.
 

Sien

将来: NEET
Joined
Sep 6, 2014
Messages
2,197
Location
大学入試地獄
Gender
Male
HSC
2016
Re: HSC 2016 2U Marathon

My thinking for question

i) 2C1 x (0.20)^1 x (0.80)^1 = 0.32

ii) I drew a tree diagram for this question and equated the probability of winning at least 0.90 , after losing in 'n' attempts
0.90= 1-(0.80)^n

n=10.32

A minimum number of times to ensure that he has at least a 90% chance of winning, will be 11 times.
You don't do combinations in 2u lol

Sent from my D6503 using Tapatalk
 

leehuan

Well-Known Member
Joined
May 31, 2014
Messages
5,805
Gender
Male
HSC
2015
Re: HSC 2016 2U Marathon

Yes, in 2U you use the tree diagram. Avoid using combinatorics in a 2U marathon where possible; even a tree diagram will suffice

Nobody's going to answer this troll question? It's honestly REALLY easy.
 

InteGrand

Well-Known Member
Joined
Dec 11, 2014
Messages
6,109
Gender
Male
HSC
N/A
Re: HSC 2016 2U Marathon

Yes, in 2U you use the tree diagram. Avoid using combinatorics in a 2U marathon where possible; even a tree diagram will suffice



Nobody's going to answer this troll question? It's honestly REALLY easy.
 

leehuan

Well-Known Member
Joined
May 31, 2014
Messages
5,805
Gender
Male
HSC
2015
Re: HSC 2016 2U Marathon

Lol.
-----------------------------------------------
NEXT QUESTION
Exercise:
 

Green Yoda

Hi Φ
Joined
Mar 28, 2015
Messages
2,859
Gender
Male
HSC
2017
Re: HSC 2016 2U Marathon

Lol.
-----------------------------------------------
NEXT QUESTION
Exercise:
Using power rule.
f(x) 1/x = x^-1. So f'(x) = -x^-2. Therefore f'(x) = -1/x^2
 

Green Yoda

Hi Φ
Joined
Mar 28, 2015
Messages
2,859
Gender
Male
HSC
2017
Re: HSC 2016 2U Marathon

This is not first principles.
my bad.

y ' = lim (h → 0) (f(x+h) - f(x)) / h
= lim (h → 0) (1/(x+h) - 1/x) / h
= lim (h → 0) (x/x(x+h) - (x + h)/x(x + h)) / h
= lim (h → 0) (-h / x(x + h)) / h
= lim (h → 0) -1 / x(x + h)
= -1/ x²
 
Last edited:
Status
Not open for further replies.

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top