Discrete mathematics required for Computer Science, including the basics of logic, number theory, methods of proof, sequences, mathematical induction, set theory, counting, and functions. Discrete ...

Read Levin's chapter on functions. Go over the exercises at the end. Note that Levin skips over the more general notion of relation -- he comes to it in a later stage, though. We will talk about ...