Average Error: 0.0 → 0.0
Time: 8.1s
Precision: 64
\[\frac{i + 1 \cdot f}{subdivisions}\]
\[\frac{i + 1 \cdot f}{subdivisions}\]
\frac{i + 1 \cdot f}{subdivisions}
\frac{i + 1 \cdot f}{subdivisions}
double f(double i, double f, double subdivisions) {
        double r626728 = i;
        double r626729 = 1.0;
        double r626730 = f;
        double r626731 = r626729 * r626730;
        double r626732 = r626728 + r626731;
        double r626733 = subdivisions;
        double r626734 = r626732 / r626733;
        return r626734;
}

double f(double i, double f, double subdivisions) {
        double r626735 = i;
        double r626736 = 1.0;
        double r626737 = f;
        double r626738 = r626736 * r626737;
        double r626739 = r626735 + r626738;
        double r626740 = subdivisions;
        double r626741 = r626739 / r626740;
        return r626741;
}

Error

Bits error versus i

Bits error versus f

Bits error versus subdivisions

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{i + 1 \cdot f}{subdivisions}\]
  2. Final simplification0.0

    \[\leadsto \frac{i + 1 \cdot f}{subdivisions}\]

Reproduce

herbie shell --seed 1 
(FPCore (i f subdivisions)
  :name "(i + 1.0f) / subdivisions"
  :precision binary64
  (/ (+ i (* 1 f)) subdivisions))