Average Error: 58.7 → 0.5
Time: 10.1s
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 r52768 = x;
        double r52769 = exp(r52768);
        double r52770 = 1.0;
        double r52771 = r52769 - r52770;
        return r52771;
}
↓
double f(double x) {
        double r52772 = x;
        double r52773 = 2.0;
        double r52774 = pow(r52772, r52773);
        double r52775 = 0.5;
        double r52776 = 0.16666666666666666;
        double r52777 = r52772 * r52776;
        double r52778 = r52775 + r52777;
        double r52779 = r52774 * r52778;
        double r52780 = r52779 + r52772;
        return r52780;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

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

Derivation

  1. Initial program 58.7

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

  4. Final simplification0.5

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

Reproduce

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