∀ n ∈ N n2 + n + 41
It goes on to tell what ∀ means, and what N means, but excludes ∈.
This tells me there is a level of maths prerequisites required. For those of us who had liberal arts backgrounds with very little math who are programmers by sweat and knack, where can one go to get enough training to be ready to read something like this? I'd love to get through it and finally feel I'm on equal footing with some of my CS-trained peers (and actually be able to leverage the concepts at work) but seeing this early in the book leads me to believe I need some prerequisites first.
Thanks for your advice.
You must not have been the only person to notice this. The definition is on pg 6 in the pdf above.
I feel I can now go back and cover all the math i've forgotten since the first couple CS years (only a couple years ago!). I'm not really sure if it is worth the time from a practical standpoint, however I always feel slightly slower than other students when it comes to algorithm-related classes.
Hopefully this should get me up to speed again!