Average Error: 0.0 → 0.0
Time: 2.2s
Precision: binary64
Cost: 12992
\[e^{re} \cdot \cos im\]
↓
\[e^{re} \cdot \cos im\]
e^{re} \cdot \cos im
↓
e^{re} \cdot \cos im
(FPCore (re im) :precision binary64 (* (exp re) (cos im)))
↓
(FPCore (re im) :precision binary64 (* (exp re) (cos im)))
double code(double re, double im) {
	return exp(re) * cos(im);
}
↓
double code(double re, double im) {
	return exp(re) * cos(im);
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Alternatives

Alternative 1
Error40.5
Cost64
\[1\]
Alternative 2
Error41.5
Cost64
\[0\]
Alternative 3
Error60.5
Cost64
\[-1\]

Error

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2021022 
(FPCore (re im)
  :name "math.exp on complex, real part"
  :precision binary64
  (* (exp re) (cos im)))