To give an example, the hardest math I can remember is one exercise where they ask you to _prove_ the equation listed if you search for "closed form" at http://en.wikipedia.org/wiki/Fibonacci_number .

I'm relatively sure that the point of this exercise was just to drive home that performance characteristics of a problem can be non-obvious. We just finished making an O(n) implementation of Fibonacci numbers and feel pretty good about it, but oh wait, you can actually do it in O(1).

However, to literally answer your question, the math used in exercises mostly tops out at polynomial algebra (like, adding X^2 + 3X + 1 to 3X^2 + 3), with a little bit of calculus - namely taking derivatives (and maybe integrals? I forget) of polynomials. The calculus is not used to solve a problem - rather you're implementing a program that lets the user take derivatives of polynomials.

You might also try starting with the videos, which are more-code, less-equations. But to get maximum benefits, one must do the exercises (at least some of them), so you'll still need the book.

[1] http://en.wikipedia.org/wiki/Concrete_Mathematics