Average Error: 0.3 → 0.3
Time: 12.8s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r39333 = x;
        double r39334 = log(r39333);
        double r39335 = r39333 * r39334;
        return r39335;
}
↓
double f(double x) {
        double r39336 = x;
        double r39337 = log(r39336);
        double r39338 = r39336 * r39337;
        return r39338;
}

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