Average Error: 0.3 → 0.3
Time: 5.6s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r39844 = x;
        double r39845 = log(r39844);
        double r39846 = r39844 * r39845;
        return r39846;
}
↓
double f(double x) {
        double r39847 = x;
        double r39848 = log(r39847);
        double r39849 = r39847 * r39848;
        return r39849;
}

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