Average Error: 0.0 → 0.0
Time: 2.9s
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 r40995 = re;
        double r40996 = exp(r40995);
        double r40997 = im;
        double r40998 = sin(r40997);
        double r40999 = r40996 * r40998;
        return r40999;
}
↓
double f(double re, double im) {
        double r41000 = re;
        double r41001 = exp(r41000);
        double r41002 = im;
        double r41003 = sin(r41002);
        double r41004 = r41001 * r41003;
        return r41004;
}

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 2019353 +o rules:numerics
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  :precision binary64
  (* (exp re) (sin im)))