Average Error: 0.0 → 0.0
Time: 958.0ms
Precision: 64
\[re \cdot im + im \cdot re\]
↓
\[\left(2 \cdot re\right) \cdot im\]
re \cdot im + im \cdot re
↓
\left(2 \cdot re\right) \cdot im
double f(double re, double im) {
        double r8132 = re;
        double r8133 = im;
        double r8134 = r8132 * r8133;
        double r8135 = r8133 * r8132;
        double r8136 = r8134 + r8135;
        return r8136;
}
↓
double f(double re, double im) {
        double r8137 = 2.0;
        double r8138 = re;
        double r8139 = r8137 * r8138;
        double r8140 = im;
        double r8141 = r8139 * r8140;
        return r8141;
}

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}{\left(2 \cdot re\right) \cdot im}\]

  3. Final simplification0.0

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

Reproduce

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