g(x) is a quadratic function given by:
g(x) = x² + 12x + 30.

Determine all possible real roots of this equation:
g(g(g(g(g(x))))) = 0

(In reply to Jer seems right; I must have erred somewhere by Charlie)

I think I found your problem, each time you recurse into the sub routine you are reducing c, where you should only be reducing it once each time.  In other words, here is what you are doing

first time into the sub you find 2 roots of
g(x)=0
lets say one of them is z1
then you recurse back into the sub reducing c by z1
so then you are solving g(x)-z1=0
lets say one of them is z2
then when you recurse this second time you are now solving
g(x)-z1-z2=0 when you should be solving g(x)-z2=0

Posted by Daniel on 2013-11-05 21:20:59