Average Error: 0.3 → 0.3
Time: 13.6s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r38740 = x;
        double r38741 = log(r38740);
        double r38742 = r38740 * r38741;
        return r38742;
}
↓
double f(double x) {
        double r38743 = x;
        double r38744 = log(r38743);
        double r38745 = r38743 * r38744;
        return r38745;
}

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