Average Error: 0.3 → 0.3
Time: 5.6s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r37812 = x;
        double r37813 = log(r37812);
        double r37814 = r37812 * r37813;
        return r37814;
}
↓
double f(double x) {
        double r37815 = x;
        double r37816 = log(r37815);
        double r37817 = r37815 * r37816;
        return r37817;
}

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