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 r8434 = re;
        double r8435 = im;
        double r8436 = r8434 * r8435;
        double r8437 = r8435 * r8434;
        double r8438 = r8436 + r8437;
        return r8438;
}
↓
double f(double re, double im) {
        double r8439 = re;
        double r8440 = im;
        double r8441 = r8440 + r8440;
        double r8442 = r8439 * r8441;
        return r8442;
}

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)))