right i broke my brain trying to answer these in my trial. so i thought they might be interesting to see other approaches.
a) prove (cos x) - 1 + (x^2/2) > 0
i stared that this for a good minute or so then said "buggrit" and moved on.
b) <i>refer to attachment for diagram. pardon my crappy drawing, but its clear enough to make out.</i>
a special chess board is made such that it has five rows and eight columns. 3 squares are marked upon it, as in the diagram, x y and m.
i: if a player can only move in the directions shown upon the board, one square at a time, how many ways are there to get from x to y?
ii: how many ways are there to get from x to y if the player <u>must</u> pass through m.
i think i got the 1st part of this one, but not the second.
cheers people.
a) prove (cos x) - 1 + (x^2/2) > 0
i stared that this for a good minute or so then said "buggrit" and moved on.
b) <i>refer to attachment for diagram. pardon my crappy drawing, but its clear enough to make out.</i>
a special chess board is made such that it has five rows and eight columns. 3 squares are marked upon it, as in the diagram, x y and m.
i: if a player can only move in the directions shown upon the board, one square at a time, how many ways are there to get from x to y?
ii: how many ways are there to get from x to y if the player <u>must</u> pass through m.
i think i got the 1st part of this one, but not the second.
cheers people.