Average Error: 0.3 → 0.3
Time: 5.8s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r31171 = x;
        double r31172 = log(r31171);
        double r31173 = r31171 * r31172;
        return r31173;
}
↓
double f(double x) {
        double r31174 = x;
        double r31175 = log(r31174);
        double r31176 = r31174 * r31175;
        return r31176;
}

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