Solution Techniques

Substitution Method: Guess bound then use mathematical induction to prove
Iteration Method: Convert recurrence to summation and bound summation
Master Method: Simple solutions to recurrences of the form

$$T(n) = aT(n/b) + f(n), \;\;\;\; a \geq 1, \; b>1$$

In general, omit floors, ceilings and boundary conditions - they typically add only a constant factor.