Here's an easy question to kick off the night...
Question: How many integers, greater than 999 but not greater than 5000, can be formed with the digits 0, 1, 2, 3, 4, 5 if repetition of digits is allowed?
Hmm... I didn't really find 2011 that difficult... as the questions that really stump me are the ones where you're meant to intuitively know when to draw graphs and how to interpret it and stuff. =( Other than that I'd say my other weakness in 3U would be the infamous "perms & combs", speaking...
Question:
Wow. I don't know about you guys, but I reckon this question is pretty difficult, and with all the pressure of being in the hall and stuff, I probably wouldn't be able to complete this in the exam. Do you guys reckon a similar sort of question will appear in this year's paper?
Draw it out. It's really simple.
Essentially it's...
Let X = A side of the equilateral triangle.
Tan 60 = 12/x
x = 12/root3
Next part has two ways:
a) Area Triangle = 1/2 X Base X Height = 1/2 X 2x X 12
b) Area Triangle = 1/2 X A X B X Sin C = 1/2 X 2x X 2x X sin60
Do you mean the 'long conclusion' by Skeptyks? And if not, the one I issued myself? Or is my one just fine the way it is? Concise and straight to the point? And if not either his or mine, what do you propose I should write instead?
What? If you mean the line before my "LHS > 21k" then no I haven't, because we have already proven that the things in the bracket are greater than 1 in the 'verify for n=2' segment.