I tried playing around with it to use BigIntegers instead of ints, it still caused stack overflows as well; I think I understand this function a bit more, however; the book asks to describe what functions of

can be thought of as mathematical equations. For 1, it seems like it is binary; A 1 10 produces 1024.

I'd like to thank you for the suggestion to think of fibbonaci for the function i described above. I was able to solve it with

Code:

`(define(f n)`

(define(f-iter a b c count)

(if(= count 0)

c

((+ a b c)a b(- count 1))))

(f-iter(2 1 0 n)))

I really appreciate you helping me out with this stuff; and sending me your rpl IDE jos. I got the reference material you have sent me but I haven't gotten to read much of it yet.

I hope you won't mind if I ask for your help on some of the problems on SICP. Is a lot of the stuff in the book very heavily math based? My math skills aren't as good as I'd like, but I am willing to learn more as well.