Average Error: 0.3 → 0.3
Time: 18.7s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r43296 = x;
        double r43297 = log(r43296);
        double r43298 = r43296 * r43297;
        return r43298;
}
↓
double f(double x) {
        double r43299 = x;
        double r43300 = log(r43299);
        double r43301 = r43299 * r43300;
        return r43301;
}

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