Average Error: 0.1 → 0.1
Time: 47.0s
Precision: binary64
\[e^{\mathsf{lgamma} \left( \sqrt{n} + 1 \right)}\]
↓
\[e^{\mathsf{lgamma} \left( \sqrt{n} + 1 \right)}\]
e^{\mathsf{lgamma} \left( \sqrt{n} + 1 \right)}
↓
e^{\mathsf{lgamma} \left( \sqrt{n} + 1 \right)}
double code(double n) {
	return ((double) exp(((double) lgamma(((double) (((double) sqrt(n)) + 1.0))))));
}
↓
double code(double n) {
	return ((double) exp(((double) lgamma(((double) (((double) sqrt(n)) + 1.0))))));
}

Error

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[e^{\mathsf{lgamma} \left( \sqrt{n} + 1 \right)}\]

  2. Final simplification0.1

    \[\leadsto e^{\mathsf{lgamma} \left( \sqrt{n} + 1 \right)}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (n)
  :name "(exp (lgamma (+ (sqrt n) 1.0)))"
  :precision binary64
  (exp (lgamma (+ (sqrt n) 1.0))))