Average Error: 0.3 → 0.3
Time: 10.7s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r40557 = x;
        double r40558 = log(r40557);
        double r40559 = r40557 * r40558;
        return r40559;
}
↓
double f(double x) {
        double r40560 = x;
        double r40561 = log(r40560);
        double r40562 = r40560 * r40561;
        return r40562;
}

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