Average Error: 0.0 → 0.0
Time: 890.0ms
Precision: 64
\[re \cdot im + im \cdot re\]
↓
\[re \cdot im + im \cdot re\]
re \cdot im + im \cdot re
↓
re \cdot im + im \cdot re
double f(double re, double im) {
        double r8384 = re;
        double r8385 = im;
        double r8386 = r8384 * r8385;
        double r8387 = r8385 * r8384;
        double r8388 = r8386 + r8387;
        return r8388;
}
↓
double f(double re, double im) {
        double r8389 = re;
        double r8390 = im;
        double r8391 = r8389 * r8390;
        double r8392 = r8390 * r8389;
        double r8393 = r8391 + r8392;
        return r8393;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2019347 
(FPCore (re im)
  :name "math.square on complex, imaginary part"
  :precision binary64
  (+ (* re im) (* im re)))