Average Error: 0.3 → 0.3
Time: 12.1s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r40587 = x;
        double r40588 = log(r40587);
        double r40589 = r40587 * r40588;
        return r40589;
}
↓
double f(double x) {
        double r40590 = x;
        double r40591 = log(r40590);
        double r40592 = r40590 * r40591;
        return r40592;
}

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