Average Error: 58.5 → 0.5
Time: 6.6s
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 r52518 = x;
        double r52519 = exp(r52518);
        double r52520 = 1.0;
        double r52521 = r52519 - r52520;
        return r52521;
}
↓
double f(double x) {
        double r52522 = x;
        double r52523 = 2.0;
        double r52524 = pow(r52522, r52523);
        double r52525 = 0.16666666666666666;
        double r52526 = r52522 * r52525;
        double r52527 = 0.5;
        double r52528 = r52526 + r52527;
        double r52529 = r52524 * r52528;
        double r52530 = r52529 + r52522;
        return r52530;
}

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 2019308 
(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))