Average Error: 0.0 → 0.0
Time: 14.1s
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 r28226 = re;
        double r28227 = exp(r28226);
        double r28228 = im;
        double r28229 = sin(r28228);
        double r28230 = r28227 * r28229;
        return r28230;
}
↓
double f(double re, double im) {
        double r28231 = re;
        double r28232 = exp(r28231);
        double r28233 = im;
        double r28234 = sin(r28233);
        double r28235 = r28232 * r28234;
        return r28235;
}

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