powered by
Uses a bisectioning algorithm to search the give interval for a change of sign and returns the integer which is closest to 0.
uniroot_int( f, interval, ..., f.lower = f(interval[1], ...), f.upper = f(interval[2], ...), maxIter = 1000 )