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

Error

Bits error versus f

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{\left(\left(2 \cdot \pi\right) \cdot f\right) \cdot x}\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020152 
(FPCore (f x)
  :name "(exp (* (* (* 2 PI) f) x))"
  :precision binary64
  (exp (* (* (* 2.0 PI) f) x)))