HSC 2014 MX2 Marathon (archive) (1 Viewer)

Status
Not open for further replies.

Sy123

This too shall pass
Joined
Nov 6, 2011
Messages
3,730
Gender
Male
HSC
2013
Re: HSC 2014 4U Marathon

 
Last edited:

Tugga

Member
Joined
Sep 5, 2011
Messages
46
Gender
Male
HSC
2014
Re: HSC 2014 4U Marathon

Squaring both and adding gives you 2*(expanded form of cos(a-b)) + 2 =8/3 (since sin^2a+cos^2a=1)

So cos(a-b)=1/3

P.s. Sorry for ugly formatting, don't have the time right now to learn latex, maybe later. D:
 

Tugga

Member
Joined
Sep 5, 2011
Messages
46
Gender
Male
HSC
2014
Re: HSC 2014 4U Marathon

A q from this year's Baulko 4u trial


screenshot tool
let that cube root thingo be a.

noting a^3 = 30+18a, it follows that a^3-18a-30=0.

therefore, P(x)=x^3-18x-30

A more rigorous proof would prove that its the lowest degree. I would probably do something like square it and show you get something you can't cancel with a degree 1 polynomial?
 

madharris

Well-Known Member
Joined
Oct 23, 2011
Messages
2,160
Gender
Undisclosed
HSC
N/A
Re: HSC 2014 4U Marathon

Got a difficult one for you guys. I saw that it was going to be in carrot's trial.

 

aDimitri

i'm the cook
Joined
Aug 22, 2013
Messages
505
Location
Blue Mountains
Gender
Male
HSC
2014
Re: HSC 2014 4U Marathon

equivalent of letting x = 2n-1, where n is any integer.
let x = 2n-1 where n is an integer.



same shit to prove it for all negative odd but do n = k-1
but x^2 - 1 is an even function so it's sorta redundant to do it for negative numbers too
 

Stygian

Active Member
Joined
Aug 11, 2014
Messages
120
Gender
Undisclosed
HSC
2015
Re: HSC 2014 4U Marathon

equivalent of letting x = 2n-1, where n is any integer.
let x = 2n-1 where n is an integer.



same shit to prove it for all negative odd but do n = k-1
but x^2 - 1 is an even function so it's sorta redundant to do it for negative numbers too
alternatively u can take the approach that every odd number is congruent to

1 mod 8
3 mod 8
5 mod 8
7 mod 8

Squaring it becomes

1 mod 8
9 mod 8 or 1 mod 8
25 mod 8 or 1 mod 8
49 mod 8 or 1 mod 8

Subtracting 1 from each gives 0 mod 8 i.e. all are divisible by 8
 

aDimitri

i'm the cook
Joined
Aug 22, 2013
Messages
505
Location
Blue Mountains
Gender
Male
HSC
2014
Re: HSC 2014 4U Marathon

alternatively u can take the approach that every odd number is congruent to

1 mod 8
3 mod 8
5 mod 8
7 mod 8

Squaring it becomes

1 mod 8
9 mod 8 or 1 mod 8
25 mod 8 or 1 mod 8
49 mod 8 or 1 mod 8

Subtracting 1 from each gives 0 mod 8 i.e. all are divisible by 8
but it's still not proven for all odd, just shown for the first 4
 

Stygian

Active Member
Joined
Aug 11, 2014
Messages
120
Gender
Undisclosed
HSC
2015
Re: HSC 2014 4U Marathon

oh true yeah.
derp moment T_T
haha it's ok :)

i do think the mod arithmetic approach is better in terms of efficiency but obviously your solution is more within the scope of the course and so better for this thread
 

Stygian

Active Member
Joined
Aug 11, 2014
Messages
120
Gender
Undisclosed
HSC
2015
Re: HSC 2014 4U Marathon

(also im having a brain fart on that problem you posted in the Advanced thread, i can't seem to think of how to approach it)
 
Status
Not open for further replies.

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

Top