Average Error: 0.0 → 0.0
Time: 3.5s
Precision: binary64
\[re \cdot im + im \cdot re\]
\[2 \cdot \left(im \cdot re\right)\]
re \cdot im + im \cdot re
2 \cdot \left(im \cdot re\right)
double code(double re, double im) {
	return ((double) (((double) (re * im)) + ((double) (im * re))));
}
double code(double re, double im) {
	return ((double) (2.0 * ((double) (im * re))));
}

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

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

Reproduce

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