Average Error: 0.0 → 0.0
Time: 4.8s
Precision: binary64
\[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right)\]
↓
\[0.5 \cdot \frac{\cos re}{e^{im}} + e^{im} \cdot \left(0.5 \cdot \cos re\right)\]
\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right)
↓
0.5 \cdot \frac{\cos re}{e^{im}} + e^{im} \cdot \left(0.5 \cdot \cos re\right)
(FPCore (re im)
 :precision binary64
 (* (* 0.5 (cos re)) (+ (exp (- im)) (exp im))))
↓
(FPCore (re im)
 :precision binary64
 (+ (* 0.5 (/ (cos re) (exp im))) (* (exp im) (* 0.5 (cos re)))))
double code(double re, double im) {
	return ((double) (((double) (0.5 * ((double) cos(re)))) * ((double) (((double) exp(((double) -(im)))) + ((double) exp(im))))));
}
↓
double code(double re, double im) {
	return ((double) (((double) (0.5 * (((double) cos(re)) / ((double) exp(im))))) + ((double) (((double) exp(im)) * ((double) (0.5 * ((double) cos(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 Error: 0.0 bits

    \[\left(0.5 \cdot \cos re\right) \cdot \left(e^{-im} + e^{im}\right)\]
  2. Using strategy rm

  3. Applied distribute-lft-inError: 0.0 bits

    \[\leadsto \color{blue}{\left(0.5 \cdot \cos re\right) \cdot e^{-im} + \left(0.5 \cdot \cos re\right) \cdot e^{im}}\]

  4. SimplifiedError: 0.0 bits

    \[\leadsto \color{blue}{0.5 \cdot \frac{\cos re}{e^{im}}} + \left(0.5 \cdot \cos re\right) \cdot e^{im}\]

  5. SimplifiedError: 0.0 bits

    \[\leadsto 0.5 \cdot \frac{\cos re}{e^{im}} + \color{blue}{e^{im} \cdot \left(0.5 \cdot \cos re\right)}\]

  6. Final simplificationError: 0.0 bits

    \[\leadsto 0.5 \cdot \frac{\cos re}{e^{im}} + e^{im} \cdot \left(0.5 \cdot \cos re\right)\]

Reproduce

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