Average Error: 0.0 → 0.0
Time: 5.3s
Precision: binary64
\[e^{re} \cdot \sin im \]
↓
\[\sin im \cdot e^{re} \]
e^{re} \cdot \sin im
↓
\sin im \cdot e^{re}

(FPCore (re im) :precision binary64 (* (exp re) (sin im)))
↓
(FPCore (re im) :precision binary64 (* (sin im) (exp re)))
double code(double re, double im) {
	return exp(re) * sin(im);
}
↓
double code(double re, double im) {
	return sin(im) * exp(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

    \[e^{re} \cdot \sin im \]

  2. Applied *-commutative_binary640.0

    \[\leadsto \color{blue}{\sin im \cdot e^{re}} \]

  3. Final simplification0.0

    \[\leadsto \sin im \cdot e^{re} \]

Reproduce

herbie shell --seed 2022067 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  :precision binary64
  (* (exp re) (sin im)))