One mathematical thing that is important in programming is algorithm complexity.

You can pick it up intuitively though, it doesn't require lots of algebra and symbols like you think of "math" normally being:
* linear time if the program just works through each element one at a time.
* quadratic time if it tests each thing against each other thing.
* exponential time if it's completely brute force.
and then 'log n' comes up when you deal with binary.

I think everyone who has been programming for a while has a good hands on understanding of these and how fast they are.