Average Error: 0.3 → 0.3
Time: 5.4s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r37019 = x;
        double r37020 = log(r37019);
        double r37021 = r37019 * r37020;
        return r37021;
}
↓
double f(double x) {
        double r37022 = x;
        double r37023 = log(r37022);
        double r37024 = r37022 * r37023;
        return r37024;
}

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