When I first read through SICP I stopped early in the book when it got the bit that required Calculus and took a massive detour to understand Calculus. Then I returned to the book, solved the problem, and discovered that the rest book had hardly any difficult math - certainly nothing that required me to know anything beyond high school math. C'est la vie.
I know this might not be so helpful for you, but I don't think it requires anything above a basic understanding of math. The "deepest" math was in the beginning, when it covered Newton's Method for square root approximation.<p>SICP is used as the introductory CS text at many universities (Berkeley included) and has no official math prerequisites. I think you should try reading it first, and if you get stuck on a concept like Newton's Method, you can just read about it on Wikipedia.<p>But otherwise, there was basically no math involved, except as simple illustrations. Good luck! It was a great text.
There are other replies that detail the strict math requirements for getting through the SICP text and how to build up in those requirements.<p>But in case you are additionally interested in further self-education in mathematics related to computer science, or other onlookers in this thread are, I'll recommend some resources in discrete mathematics,<p><a href="http://www.artofproblemsolving.com/Resources/articles.php?page=discretemath" rel="nofollow">http://www.artofproblemsolving.com/Resources/articles.php?pa...</a><p>especially those directed toward the interests of computer scientists.<p>One book with good online support is the Art of Problem Solving book on Counting and Probability.<p><a href="http://www.artofproblemsolving.com/Store/viewitem.php?item=intro:counting" rel="nofollow">http://www.artofproblemsolving.com/Store/viewitem.php?item=i...</a><p>MIT OpenCourseware has a mathematics for computer science course.<p><a href="http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-spring-2010/" rel="nofollow">http://ocw.mit.edu/courses/electrical-engineering-and-comput...</a><p>Princeton has posted lecture notes for a similar course:<p><a href="http://www.cs.princeton.edu/courses/archive/spr10/cos433/mathcs.pdf" rel="nofollow">http://www.cs.princeton.edu/courses/archive/spr10/cos433/mat...</a><p>ArsDigita University also posts math-learning resources online:<p><a href="http://aduni.org/courses/math/" rel="nofollow">http://aduni.org/courses/math/</a><p>An Amazon guide to books for self-study and an Amazon list of favorite books may also be helpful:<p><a href="http://www.amazon.com/gp/richpub/syltguides/fullview/R3NMQ393VD5UAZ" rel="nofollow">http://www.amazon.com/gp/richpub/syltguides/fullview/R3NMQ39...</a><p><a href="http://www.amazon.com/Computer-Science-and-Math-books-that-I-really-enjoy-reading/lm/RYORX8HPRBF6S" rel="nofollow">http://www.amazon.com/Computer-Science-and-Math-books-that-I...</a>
The SICP, from the chapters I've read, does not rely on mathematical sophistication the way, say, Knuth does. There's a little bit of calculus, but not much. If you've had a semester of calculus, you're probably more than well prepared. If you haven't you can probably focus instead on the data structures and algorithms.<p>Your best bet is just to grab a Scheme interpreter and dive in.
If I remember well, the Math part is only in the first or second chapter to illustrate some more abstract concepts. I'll simply suggest searching the web if there's an algorithm or a math concept that you don't know about. Furthermore, SICP does a great job at explaining the algorithm.
If you haven't already, consider HtDP instead. It is designed to require no knowledge of mathematics beyond basic arithmetic. It fulfils a similar role to SICP. It is often argued that HtDP is a weaker text than SICP, but I found it a very useful course.