We say a finite sequence is unimodal if it can be split into a monotonically increasing sequence followed by a monotonically decreasing one. Many interesting sequences arising in combinatorics are unimodal - for example, the rows of Pascal's triangle are all unimodal. In most cases we are interested in, a sufficient condition for unimodality is log-concavity, and for some sequences this is easier to show. This talk, based on an old survey paper by Stanley, will cover the definitions of log-concavity and unimodality, introduce some interesting examples of such sequences, and explore how one might show that these sequences are log-concave and/or unimodal. Speaker(s): Robert Cochrane (UM)