Average Error: 0.0 → 0.0
Time: 1.6s
Precision: 64
\[e^{re} \cdot \sin im\]
↓
\[e^{re} \cdot \sin im\]
e^{re} \cdot \sin im
↓
e^{re} \cdot \sin im
double f(double re, double im) {
        double r40150 = re;
        double r40151 = exp(r40150);
        double r40152 = im;
        double r40153 = sin(r40152);
        double r40154 = r40151 * r40153;
        return r40154;
}
↓
double f(double re, double im) {
        double r40155 = re;
        double r40156 = exp(r40155);
        double r40157 = im;
        double r40158 = sin(r40157);
        double r40159 = r40156 * r40158;
        return r40159;
}

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. Final simplification0.0

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

Reproduce

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