Search results

I only use the bookshop for course notes. Others can be picked up elsewhere cheaper. Although it's a 20-50 (10- 25 cheeseburgers) saving, it can add up.

If you don't care about book condition but only the content inside a book. There are some good second hand ones online (possibly). It will save you heaps.

Bump =)

Interesting new covers.

^Copied and pasted his layout because I cannot be bothered writing it. MATH1241 Ease: 7/10. More difficult than first semester since topics are slightly more abstract and take more time to learn. Content: 7/10. Some parts were interesting, but I didn't enjoy the content as much as first...

I only have 17 games on the board. Silver III :(

I think Ima play cs for a bit now.

AWP is the beast.

Fav maps de_dust2 de_nuke de_mirage

P.S my fav weapons are the AK-47, P250 and the AWP.

I just love love this game so much it hurts. Talk about anything Counterstrike related here. Dem kids with fast reactions.

Re: HSC 2013 4U Marathon For the last Q I posted a hint is the triangular inequality.

^Yes

It does if the statement is in fact true. (which it is)

$Between three consecutive numbers at least one must be even and one must be a multiple of$\;3. n(n+1)(n+2) $Say$\; n \;$was the even one and$\; (n+1)\; $was the one divisible by$\; 3. \;$Then we can write$\; n = 2j\; $for integer$\; j \;$and$\; n+1 = 3m\; $for some integer$\; m. \;$In all...

I think this question was also in bos trials^

But unfortunately, HSC papers like to get you to prove via induction (which can be tedious). For example a common induction problem is prove that n^3+3n^2+2n is divisible by 6. But it can be achieved using one a couple of lines (or less). Equivalent of proving \frac{n(n+1)(n+2)}{6}=m for some...

Yup

More generally you may want to see if you can prove the sum of n consecutive odd integers is divisible by n.

The result is for the sum of two consecutive odd integers