Average Error: 0.2 → 0.2
Time: 19.0s
Precision: 64
\[\frac{w}{n} + c \cdot \sqrt{\frac{\log m}{n}}\]
\[\frac{w}{n} + c \cdot \sqrt{\frac{\log m}{n}}\]
\frac{w}{n} + c \cdot \sqrt{\frac{\log m}{n}}
\frac{w}{n} + c \cdot \sqrt{\frac{\log m}{n}}
double f(double w, double n, double c, double m) {
        double r692854 = w;
        double r692855 = n;
        double r692856 = r692854 / r692855;
        double r692857 = c;
        double r692858 = m;
        double r692859 = log(r692858);
        double r692860 = r692859 / r692855;
        double r692861 = sqrt(r692860);
        double r692862 = r692857 * r692861;
        double r692863 = r692856 + r692862;
        return r692863;
}

double f(double w, double n, double c, double m) {
        double r692864 = w;
        double r692865 = n;
        double r692866 = r692864 / r692865;
        double r692867 = c;
        double r692868 = m;
        double r692869 = log(r692868);
        double r692870 = r692869 / r692865;
        double r692871 = sqrt(r692870);
        double r692872 = r692867 * r692871;
        double r692873 = r692866 + r692872;
        return r692873;
}

Error

Bits error versus w

Bits error versus n

Bits error versus c

Bits error versus m

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.2

    \[\frac{w}{n} + c \cdot \sqrt{\frac{\log m}{n}}\]
  2. Final simplification0.2

    \[\leadsto \frac{w}{n} + c \cdot \sqrt{\frac{\log m}{n}}\]

Reproduce

herbie shell --seed 1 
(FPCore (w n c m)
  :name "w/n + c*sqrt(log(m)/n)"
  :precision binary64
  (+ (/ w n) (* c (sqrt (/ (log m) n)))))