HSC 2012 MX2 Marathon (archive) (1 Viewer)

seanieg89

Well-Known Member
Joined
Aug 8, 2006
Messages
2,662
Gender
Male
HSC
2007
Re: 2012 HSC MX2 Marathon

A pretty fast way to prove the "reflective" properties of conics.

Let ABC be a triangle. Let X be a point on BC.

i) Prove that AB/BX = AC/CX if and only if the line segment AX bisects the angle BAC.

ii) Using the above, state and prove the reflective property of the hyperbola: x^2/a^2 - y^2/b^2 = 1.
 

math man

Member
Joined
Sep 19, 2009
Messages
503
Location
Sydney
Gender
Male
HSC
N/A
Re: 2012 HSC MX2 Marathon

also here are some nice integration questions:

 

zeebobDD

Member
Joined
Oct 23, 2011
Messages
414
Gender
Male
HSC
2012
Re: 2012 HSC MX2 Marathon

can someone explain to me why a point say Q( a sec(90-x), b tan(90-x)) = a cosec x , b cot x?
 

deswa1

Well-Known Member
Joined
Jul 12, 2011
Messages
2,256
Gender
Male
HSC
2012
Re: 2012 HSC MX2 Marathon

sec(90-x)=1/cos(90-x)=1/sinx=cosecx. Similarly, tan(90-x)=cotx
 

deswa1

Well-Known Member
Joined
Jul 12, 2011
Messages
2,256
Gender
Male
HSC
2012
Re: 2012 HSC MX2 Marathon

This is a question from our 4U test this afternoon (I hope I remembered it correctly...):

<a href="http://www.codecogs.com/eqnedit.php?latex=\textup{Prove by induction that }\\ (1-a_{1})(1-a_{2})...(1-a_{n})>1-(a_{1}@plus;a_{2}@plus;...@plus;a_{n})\\ \textup{for positive integers n}\geq 2 \textup{ where}\\ 0<a_{k}<1 \textup{ for }1<k<n" target="_blank"><img src="http://latex.codecogs.com/gif.latex?\textup{Prove by induction that }\\ (1-a_{1})(1-a_{2})...(1-a_{n})>1-(a_{1}+a_{2}+...+a_{n})\\ \textup{for positive integers n}\geq 2 \textup{ where}\\ 0<a_{k}<1 \textup{ for }1<k<n" title="\textup{Prove by induction that }\\ (1-a_{1})(1-a_{2})...(1-a_{n})>1-(a_{1}+a_{2}+...+a_{n})\\ \textup{for positive integers n}\geq 2 \textup{ where}\\ 0<a_{k}<1 \textup{ for }1<k<n" /></a>
 

Carrotsticks

Retired
Joined
Jun 29, 2009
Messages
9,494
Gender
Undisclosed
HSC
N/A
Re: 2012 HSC MX2 Marathon

This is a question from our 4U test this afternoon (I hope I remembered it correctly...):

<a href="http://www.codecogs.com/eqnedit.php?latex=\textup{Prove by induction that }\\ (1-a_{1})(1-a_{2})...(1-a_{n})>1-(a_{1}@plus;a_{2}@plus;...@plus;a_{n})\\ \textup{for positive integers n}\geq 2 \textup{ where}\\ 0<a_{k}<1 \textup{ for }1<k<n" target="_blank"><img src="http://latex.codecogs.com/gif.latex?\textup{Prove by induction that }\\ (1-a_{1})(1-a_{2})...(1-a_{n})>1-(a_{1}+a_{2}+...+a_{n})\\ \textup{for positive integers n}\geq 2 \textup{ where}\\ 0<a_{k}<1 \textup{ for }1<k<n" title="\textup{Prove by induction that }\\ (1-a_{1})(1-a_{2})...(1-a_{n})>1-(a_{1}+a_{2}+...+a_{n})\\ \textup{for positive integers n}\geq 2 \textup{ where}\\ 0<a_{k}<1 \textup{ for }1<k<n" /></a>
haha.

 
Last edited:

Carrotsticks

Retired
Joined
Jun 29, 2009
Messages
9,494
Gender
Undisclosed
HSC
N/A
Re: 2012 HSC MX2 Marathon

Well really I suppose more justification is needed etc but meh.
 

Carrotsticks

Retired
Joined
Jun 29, 2009
Messages
9,494
Gender
Undisclosed
HSC
N/A
Re: 2012 HSC MX2 Marathon

It's not clear at all why the whole second part thingo after the sum ai is necessarily positive.
Haha I know, that's why I said it needs justification, because whether it's a plus or a minus is dependent on what n is.
 

largarithmic

Member
Joined
Aug 9, 2011
Messages
202
Gender
Male
HSC
2011
Re: 2012 HSC MX2 Marathon

Haha I know, that's why I said it needs justification, because whether it's a plus or a minus is dependent on what n is.
It doesnt just depend on whether its a plus or minus though. Like, you have I think n-2 or n-3 sums after that, and its not clear that given a certain sum it has say, a bigger absolute value, than the one that comes after it for instance. Sorry but I just dont buy the argument at all :p
 

Carrotsticks

Retired
Joined
Jun 29, 2009
Messages
9,494
Gender
Undisclosed
HSC
N/A
Re: 2012 HSC MX2 Marathon

It doesnt just depend on whether its a plus or minus though. Like, you have I think n-2 or n-3 sums after that, and its not clear that given a certain sum it has say, a bigger absolute value, than the one that comes after it for instance. Sorry but I just dont buy the argument at all :p
We are told that a_k E (0,1), so this raises the issue to prove that:



And it can the inequality follows.

Sorry if I'm being vague. The new *fabulous* Carslaw rooms closes in 5 minutes and I'm already pushing the security guard's patience =D

I'll put a more rigorous proof when I get home and have dinner. Sydney Uni Union sandwiches just don't cut it nowadays.
 

seanieg89

Well-Known Member
Joined
Aug 8, 2006
Messages
2,662
Gender
Male
HSC
2007
Re: 2012 HSC MX2 Marathon

The induction is straightforward.

 

largarithmic

Member
Joined
Aug 9, 2011
Messages
202
Gender
Male
HSC
2011
Re: 2012 HSC MX2 Marathon

We are told that a_k E (0,1), so this raises the issue to prove that:



And it can the inequality follows.

Sorry if I'm being vague. The new *fabulous* Carslaw rooms closes in 5 minutes and I'm already pushing the security guard's patience =D

I'll put a more rigorous proof when I get home and have dinner. Sydney Uni Union sandwiches just don't cut it nowadays.
I assume the inequality signs are supposed to be the other way; but youve got a problem because there are by no means the same number of summands in sum aiaj and sum aiajak.
 

math man

Member
Joined
Sep 19, 2009
Messages
503
Location
Sydney
Gender
Male
HSC
N/A
Re: 2012 HSC MX2 Marathon

This is a question from our 4U test this afternoon (I hope I remembered it correctly...):

<a href="http://www.codecogs.com/eqnedit.php?latex=\textup{Prove by induction that }\\ (1-a_{1})(1-a_{2})...(1-a_{n})>1-(a_{1}@plus;a_{2}@plus;...@plus;a_{n})\\ \textup{for positive integers n}\geq 2 \textup{ where}\\ 0<a_{k}<1 \textup{ for }1<k<n" target="_blank"><img src="http://latex.codecogs.com/gif.latex?\textup{Prove by induction that }\\ (1-a_{1})(1-a_{2})...(1-a_{n})>1-(a_{1}+a_{2}+...+a_{n})\\ \textup{for positive integers n}\geq 2 \textup{ where}\\ 0<a_{k}<1 \textup{ for }1<k<n" title="\textup{Prove by induction that }\\ (1-a_{1})(1-a_{2})...(1-a_{n})>1-(a_{1}+a_{2}+...+a_{n})\\ \textup{for positive integers n}\geq 2 \textup{ where}\\ 0<a_{k}<1 \textup{ for }1<k<n" /></a>
this the tech test?
 

jenslekman

Member
Joined
Oct 11, 2011
Messages
290
Gender
Male
HSC
2012
Re: 2012 HSC MX2 Marathon

mate, how long was teh solution for that?
 

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

Top