Average Error: 14.8 → 0.1
Time: 5.9s
Precision: 64
\[\frac{1}{x + 1} - \frac{1}{x}\]
↓
\[\frac{\frac{1}{x + 1} \cdot \left(-1\right)}{x}\]
\frac{1}{x + 1} - \frac{1}{x}
↓
\frac{\frac{1}{x + 1} \cdot \left(-1\right)}{x}
double f(double x) {
        double r29926 = 1.0;
        double r29927 = x;
        double r29928 = r29927 + r29926;
        double r29929 = r29926 / r29928;
        double r29930 = r29926 / r29927;
        double r29931 = r29929 - r29930;
        return r29931;
}
↓
double f(double x) {
        double r29932 = 1.0;
        double r29933 = x;
        double r29934 = r29933 + r29932;
        double r29935 = r29932 / r29934;
        double r29936 = -r29932;
        double r29937 = r29935 * r29936;
        double r29938 = r29937 / r29933;
        return r29938;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 14.8

    \[\frac{1}{x + 1} - \frac{1}{x}\]
  2. Using strategy rm

  3. Applied frac-sub14.1

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

  4. Simplified14.1

    \[\leadsto \frac{\color{blue}{1 \cdot \left(x - \left(x + 1\right)\right)}}{\left(x + 1\right) \cdot x}\]
  5. Using strategy rm

  6. Applied associate-/r*14.2

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

  7. Simplified0.1

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

  8. Final simplification0.1

    \[\leadsto \frac{\frac{1}{x + 1} \cdot \left(-1\right)}{x}\]

Reproduce

herbie shell --seed 2020042 +o rules:numerics
(FPCore (x)
  :name "2frac (problem 3.3.1)"
  :precision binary64
  (- (/ 1 (+ x 1)) (/ 1 x)))