Average Error: 58.5 → 0.5
Time: 13.3s
Precision: 64
\[-1.700000000000000122124532708767219446599 \cdot 10^{-4} \lt x\]
\[e^{x} - 1\]
\[{x}^{2} \cdot \left(x \cdot \frac{1}{6} + \frac{1}{2}\right) + x\]
e^{x} - 1
{x}^{2} \cdot \left(x \cdot \frac{1}{6} + \frac{1}{2}\right) + x
double f(double x) {
        double r49397 = x;
        double r49398 = exp(r49397);
        double r49399 = 1.0;
        double r49400 = r49398 - r49399;
        return r49400;
}

double f(double x) {
        double r49401 = x;
        double r49402 = 2.0;
        double r49403 = pow(r49401, r49402);
        double r49404 = 0.16666666666666666;
        double r49405 = r49401 * r49404;
        double r49406 = 0.5;
        double r49407 = r49405 + r49406;
        double r49408 = r49403 * r49407;
        double r49409 = r49408 + r49401;
        return r49409;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original58.5
Target0.5
Herbie0.5
\[x \cdot \left(\left(1 + \frac{x}{2}\right) + \frac{x \cdot x}{6}\right)\]

Derivation

  1. Initial program 58.5

    \[e^{x} - 1\]
  2. Taylor expanded around 0 0.5

    \[\leadsto \color{blue}{\frac{1}{2} \cdot {x}^{2} + \left(\frac{1}{6} \cdot {x}^{3} + x\right)}\]
  3. Simplified0.5

    \[\leadsto \color{blue}{{x}^{2} \cdot \left(x \cdot \frac{1}{6} + \frac{1}{2}\right) + x}\]
  4. Final simplification0.5

    \[\leadsto {x}^{2} \cdot \left(x \cdot \frac{1}{6} + \frac{1}{2}\right) + x\]

Reproduce

herbie shell --seed 2019298 
(FPCore (x)
  :name "expm1 (example 3.7)"
  :precision binary64
  :pre (< -1.7e-4 x)

  :herbie-target
  (* x (+ (+ 1 (/ x 2)) (/ (* x x) 6)))

  (- (exp x) 1))