Average Error: 0.0 → 0.0
Time: 1.4s
Precision: 64
\[re \cdot im + im \cdot re\]
↓
\[re \cdot \left(im + im\right)\]
re \cdot im + im \cdot re
↓
re \cdot \left(im + im\right)
double f(double re, double im) {
        double r8413 = re;
        double r8414 = im;
        double r8415 = r8413 * r8414;
        double r8416 = r8414 * r8413;
        double r8417 = r8415 + r8416;
        return r8417;
}
↓
double f(double re, double im) {
        double r8418 = re;
        double r8419 = im;
        double r8420 = r8419 + r8419;
        double r8421 = r8418 * r8420;
        return r8421;
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[re \cdot im + im \cdot re\]

  2. Simplified0.0

    \[\leadsto \color{blue}{re \cdot \left(im + im\right)}\]

  3. Final simplification0.0

    \[\leadsto re \cdot \left(im + im\right)\]

Reproduce

herbie shell --seed 2019163 +o rules:numerics
(FPCore (re im)
  :name "math.square on complex, imaginary part"
  (+ (* re im) (* im re)))