Average Error: 0.3 → 0.3
Time: 5.8s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r36562 = x;
        double r36563 = log(r36562);
        double r36564 = r36562 * r36563;
        return r36564;
}
↓
double f(double x) {
        double r36565 = x;
        double r36566 = log(r36565);
        double r36567 = r36565 * r36566;
        return r36567;
}

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 2020018 
(FPCore (x)
  :name "Statistics.Distribution.Binomial:directEntropy from math-functions-0.1.5.2"
  :precision binary64
  (* x (log x)))