Average Error: 0.0 → 0.0
Time: 1.2s
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 r8437 = re;
        double r8438 = im;
        double r8439 = r8437 * r8438;
        double r8440 = r8438 * r8437;
        double r8441 = r8439 + r8440;
        return r8441;
}
↓
double f(double re, double im) {
        double r8442 = re;
        double r8443 = im;
        double r8444 = r8443 + r8443;
        double r8445 = r8442 * r8444;
        return r8445;
}

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 2019128 +o rules:numerics
(FPCore (re im)
  :name "math.square on complex, imaginary part"
  (+ (* re im) (* im re)))