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 r36016 = re;
        double r36017 = exp(r36016);
        double r36018 = im;
        double r36019 = sin(r36018);
        double r36020 = r36017 * r36019;
        return r36020;
}
↓
double f(double re, double im) {
        double r36021 = re;
        double r36022 = exp(r36021);
        double r36023 = im;
        double r36024 = sin(r36023);
        double r36025 = r36022 * r36024;
        return r36025;
}

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