Average Error: 58.5 → 0.5
Time: 2.1s
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 r93087 = x;
        double r93088 = exp(r93087);
        double r93089 = 1.0;
        double r93090 = r93088 - r93089;
        return r93090;
}
↓
double f(double x) {
        double r93091 = x;
        double r93092 = 2.0;
        double r93093 = pow(r93091, r93092);
        double r93094 = 0.16666666666666666;
        double r93095 = r93091 * r93094;
        double r93096 = 0.5;
        double r93097 = r93095 + r93096;
        double r93098 = r93093 * r93097;
        double r93099 = r93098 + r93091;
        return r93099;
}

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 2020002 
(FPCore (x)
  :name "expm1 (example 3.7)"
  :precision binary64
  :pre (< -0.00017 x)

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

  (- (exp x) 1))