Average Error: 0.3 → 0.3
Time: 4.2s
Precision: 64
\[x \cdot \log x\]
↓
\[\log x \cdot x\]
x \cdot \log x
↓
\log x \cdot x
double f(double x) {
        double r34400 = x;
        double r34401 = log(r34400);
        double r34402 = r34400 * r34401;
        return r34402;
}
↓
double f(double x) {
        double r34403 = x;
        double r34404 = log(r34403);
        double r34405 = r34404 * r34403;
        return r34405;
}

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. Using strategy rm

  3. Applied *-commutative0.3

    \[\leadsto \color{blue}{\log x \cdot x}\]

  4. Final simplification0.3

    \[\leadsto \log x \cdot x\]

Reproduce

herbie shell --seed 2019362 
(FPCore (x)
  :name "Statistics.Distribution.Binomial:directEntropy from math-functions-0.1.5.2"
  :precision binary64
  (* x (log x)))