Average Error: 0.3 → 0.3
Time: 13.1s
Precision: 64
\[x \cdot \log x\]
↓
\[x \cdot \log x\]
x \cdot \log x
↓
x \cdot \log x
double f(double x) {
        double r46823 = x;
        double r46824 = log(r46823);
        double r46825 = r46823 * r46824;
        return r46825;
}
↓
double f(double x) {
        double r46826 = x;
        double r46827 = log(r46826);
        double r46828 = r46826 * r46827;
        return r46828;
}

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