Average Error: 0.3 → 0.3
Time: 16.2s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r38562 = x;
        double r38563 = log(r38562);
        double r38564 = r38562 * r38563;
        return r38564;
}
↓
double f(double x) {
        double r38565 = x;
        double r38566 = log(r38565);
        double r38567 = r38565 * r38566;
        return r38567;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.3

    \[x \cdot \log x\]

  2. Final simplification0.3

    \[\leadsto x \cdot \log x\]

Reproduce

herbie shell --seed 2019209 +o rules:numerics
(FPCore (x)
  :name "Statistics.Distribution.Binomial:directEntropy from math-functions-0.1.5.2"
  :precision binary64
  (* x (log x)))