Average Error: 0.0 → 0.0
Time: 428.0ms
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 r306 = re;
        double r307 = im;
        double r308 = r306 * r307;
        double r309 = r307 * r306;
        double r310 = r308 + r309;
        return r310;
}
↓
double f(double re, double im) {
        double r311 = re;
        double r312 = im;
        double r313 = r312 + r312;
        double r314 = r311 * r313;
        return r314;
}

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 2019350 
(FPCore (re im)
  :name "math.square on complex, imaginary part"
  :precision binary64
  (+ (* re im) (* im re)))