Average Error: 58.9 → 0.4
Time: 7.8s
Precision: 64
\[-1.7 \cdot 10^{-4} \lt x\]
\[e^{x} - 1\]
↓
\[{x}^{2} \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right) + x\]
e^{x} - 1
↓
{x}^{2} \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right) + x
double f(double x) {
        double r52564 = x;
        double r52565 = exp(r52564);
        double r52566 = 1.0;
        double r52567 = r52565 - r52566;
        return r52567;
}
↓
double f(double x) {
        double r52568 = x;
        double r52569 = 2.0;
        double r52570 = pow(r52568, r52569);
        double r52571 = 0.5;
        double r52572 = 0.16666666666666666;
        double r52573 = r52572 * r52568;
        double r52574 = r52571 + r52573;
        double r52575 = r52570 * r52574;
        double r52576 = r52575 + r52568;
        return r52576;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

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

Derivation

  1. Initial program 58.9

    \[e^{x} - 1\]

  2. Taylor expanded around 0 0.4

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

  3. Simplified0.4

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

  4. Final simplification0.4

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

Reproduce

herbie shell --seed 2020046 
(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))