Average Error: 0.0 → 0.0
Time: 597.0ms
Precision: binary64
\[\frac{2}{e^{x} + e^{-x}}\]
↓
\[\frac{2}{e^{x} + e^{-x}}\]
\frac{2}{e^{x} + e^{-x}}
↓
\frac{2}{e^{x} + e^{-x}}
(FPCore (x) :precision binary64 (/ 2.0 (+ (exp x) (exp (- x)))))
↓
(FPCore (x) :precision binary64 (/ 2.0 (+ (exp x) (exp (- x)))))
double code(double x) {
	return (2.0 / ((double) (((double) exp(x)) + ((double) exp(((double) -(x)))))));
}
↓
double code(double x) {
	return (2.0 / ((double) (((double) exp(x)) + ((double) exp(((double) -(x)))))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program Error: 0.0 bits

    \[\frac{2}{e^{x} + e^{-x}}\]

  2. Final simplificationError: 0.0 bits

    \[\leadsto \frac{2}{e^{x} + e^{-x}}\]

Reproduce

herbie shell --seed 2020204 
(FPCore (x)
  :name "Hyperbolic secant"
  :precision binary64
  (/ 2.0 (+ (exp x) (exp (- x)))))