Average Error: 0.0 → 0.0
Time: 19.7s
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 r32375 = re;
        double r32376 = exp(r32375);
        double r32377 = im;
        double r32378 = sin(r32377);
        double r32379 = r32376 * r32378;
        return r32379;
}
↓
double f(double re, double im) {
        double r32380 = re;
        double r32381 = exp(r32380);
        double r32382 = im;
        double r32383 = sin(r32382);
        double r32384 = r32381 * r32383;
        return r32384;
}

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