Average Error: 0.3 → 0.0
Time: 5.1s
Precision: binary64
\[\frac{6 \cdot \left(x - 1\right)}{\left(x + 1\right) + 4 \cdot \sqrt{x}}\]
↓
\[6 \cdot \frac{x - 1}{\left(x + 1\right) + 4 \cdot \sqrt{x}}\]
\frac{6 \cdot \left(x - 1\right)}{\left(x + 1\right) + 4 \cdot \sqrt{x}}
↓
6 \cdot \frac{x - 1}{\left(x + 1\right) + 4 \cdot \sqrt{x}}
double code(double x) {
	return (((double) (6.0 * ((double) (x - 1.0)))) / ((double) (((double) (x + 1.0)) + ((double) (4.0 * ((double) sqrt(x)))))));
}
↓
double code(double x) {
	return ((double) (6.0 * (((double) (x - 1.0)) / ((double) (((double) (x + 1.0)) + ((double) (4.0 * ((double) sqrt(x)))))))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.3
Target0.1
Herbie0.0
\[\frac{6}{\frac{\left(x + 1\right) + 4 \cdot \sqrt{x}}{x - 1}}\]

Derivation

  1. Initial program 0.3

    \[\frac{6 \cdot \left(x - 1\right)}{\left(x + 1\right) + 4 \cdot \sqrt{x}}\]
  2. Using strategy rm

  3. Applied *-un-lft-identity0.3

    \[\leadsto \frac{6 \cdot \left(x - 1\right)}{\color{blue}{1 \cdot \left(\left(x + 1\right) + 4 \cdot \sqrt{x}\right)}}\]

  4. Applied times-frac0.0

    \[\leadsto \color{blue}{\frac{6}{1} \cdot \frac{x - 1}{\left(x + 1\right) + 4 \cdot \sqrt{x}}}\]

  5. Simplified0.0

    \[\leadsto \color{blue}{6} \cdot \frac{x - 1}{\left(x + 1\right) + 4 \cdot \sqrt{x}}\]

  6. Final simplification0.0

    \[\leadsto 6 \cdot \frac{x - 1}{\left(x + 1\right) + 4 \cdot \sqrt{x}}\]

Reproduce

herbie shell --seed 2020182 
(FPCore (x)
  :name "Data.Approximate.Numerics:blog from approximate-0.2.2.1"
  :precision binary64

  :herbie-target
  (/ 6.0 (/ (+ (+ x 1.0) (* 4.0 (sqrt x))) (- x 1.0)))

  (/ (* 6.0 (- x 1.0)) (+ (+ x 1.0) (* 4.0 (sqrt x)))))