Average Error: 58.9 → 0.4
Time: 16.5s
Precision: 64
\[-1.700000000000000122124532708767219446599 \cdot 10^{-4} \lt x\]
\[e^{x} - 1\]
↓
\[{x}^{2} \cdot \left(\frac{1}{2} + x \cdot \frac{1}{6}\right) + x\]
e^{x} - 1
↓
{x}^{2} \cdot \left(\frac{1}{2} + x \cdot \frac{1}{6}\right) + x
double f(double x) {
        double r116464 = x;
        double r116465 = exp(r116464);
        double r116466 = 1.0;
        double r116467 = r116465 - r116466;
        return r116467;
}
↓
double f(double x) {
        double r116468 = x;
        double r116469 = 2.0;
        double r116470 = pow(r116468, r116469);
        double r116471 = 0.5;
        double r116472 = 0.16666666666666666;
        double r116473 = r116468 * r116472;
        double r116474 = r116471 + r116473;
        double r116475 = r116470 * r116474;
        double r116476 = r116475 + r116468;
        return r116476;
}

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} + x \cdot \frac{1}{6}\right) + x}\]

  4. Final simplification0.4

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

Reproduce

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