Average Error: 0.0 → 0.0
Time: 1.8s
Precision: binary64
\[\frac{1}{x - 1} + \frac{x}{x + 1}\]
↓
\[\log \left(e^{\frac{1}{x - 1}}\right) + \frac{x}{1 + x}\]
\frac{1}{x - 1} + \frac{x}{x + 1}
↓
\log \left(e^{\frac{1}{x - 1}}\right) + \frac{x}{1 + x}
(FPCore (x) :precision binary64 (+ (/ 1.0 (- x 1.0)) (/ x (+ x 1.0))))
↓
(FPCore (x)
 :precision binary64
 (+ (log (exp (/ 1.0 (- x 1.0)))) (/ x (+ 1.0 x))))
double code(double x) {
	return (1.0 / (x - 1.0)) + (x / (x + 1.0));
}
↓
double code(double x) {
	return log(exp(1.0 / (x - 1.0))) + (x / (1.0 + x));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{1}{x - 1} + \frac{x}{x + 1}\]
  2. Using strategy rm

  3. Applied add-log-exp_binary64_21630.0

    \[\leadsto \color{blue}{\log \left(e^{\frac{1}{x - 1}}\right)} + \frac{x}{x + 1}\]

  4. Final simplification0.0

    \[\leadsto \log \left(e^{\frac{1}{x - 1}}\right) + \frac{x}{1 + x}\]

Reproduce

herbie shell --seed 2021028 
(FPCore (x)
  :name "Asymptote B"
  :precision binary64
  (+ (/ 1.0 (- x 1.0)) (/ x (+ x 1.0))))