Average Error: 0.0 → 0.0
Time: 1.2s
Precision: binary64
\[e^{\log 2 \cdot x + \left(\pi \cdot x\right) \cdot i}\]
↓
\[e^{\log 2 \cdot x + \left(\pi \cdot x\right) \cdot i}\]
e^{\log 2 \cdot x + \left(\pi \cdot x\right) \cdot i}
↓
e^{\log 2 \cdot x + \left(\pi \cdot x\right) \cdot i}
double code(double x, double i) {
	return ((double) exp(((double) (((double) (((double) log(2.0)) * x)) + ((double) (((double) (((double) M_PI) * x)) * i))))));
}
↓
double code(double x, double i) {
	return ((double) exp(((double) (((double) (((double) log(2.0)) * x)) + ((double) (((double) (((double) M_PI) * x)) * i))))));
}

Error

Bits error versus x

Bits error versus i

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{\log 2 \cdot x + \left(\pi \cdot x\right) \cdot i}\]

  2. Final simplification0.0

    \[\leadsto e^{\log 2 \cdot x + \left(\pi \cdot x\right) \cdot i}\]

Reproduce

herbie shell --seed 2020152 
(FPCore (x i)
  :name "(exp (+ (* (log 2.0) x) (* (* PI x) i)))"
  :precision binary64
  (exp (+ (* (log 2.0) x) (* (* PI x) i))))