Average Error: 16.9 → 12.7
Time: 9.0s
Precision: binary64
\[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)\]
\[\pi \cdot \ell - 1 \cdot \frac{1}{F \cdot \frac{F}{\tan \left(\pi \cdot \ell\right)}}\]
\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)
\pi \cdot \ell - 1 \cdot \frac{1}{F \cdot \frac{F}{\tan \left(\pi \cdot \ell\right)}}
double code(double F, double l) {
	return ((double) (((double) (((double) M_PI) * l)) - ((double) (((double) (1.0 / ((double) (F * F)))) * ((double) tan(((double) (((double) M_PI) * l))))))));
}
double code(double F, double l) {
	return ((double) (((double) (((double) M_PI) * l)) - ((double) (1.0 * ((double) (1.0 / ((double) (F * ((double) (F / ((double) tan(((double) (((double) M_PI) * l))))))))))))));
}

Error

Bits error versus F

Bits error versus l

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 16.9

    \[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)\]
  2. Simplified16.7

    \[\leadsto \color{blue}{\pi \cdot \ell - 1 \cdot \frac{\tan \left(\pi \cdot \ell\right)}{F \cdot F}}\]
  3. Using strategy rm
  4. Applied clear-num16.7

    \[\leadsto \pi \cdot \ell - 1 \cdot \color{blue}{\frac{1}{\frac{F \cdot F}{\tan \left(\pi \cdot \ell\right)}}}\]
  5. Simplified12.7

    \[\leadsto \pi \cdot \ell - 1 \cdot \frac{1}{\color{blue}{F \cdot \frac{F}{\tan \left(\pi \cdot \ell\right)}}}\]
  6. Final simplification12.7

    \[\leadsto \pi \cdot \ell - 1 \cdot \frac{1}{F \cdot \frac{F}{\tan \left(\pi \cdot \ell\right)}}\]

Reproduce

herbie shell --seed 2020181 
(FPCore (F l)
  :name "VandenBroeck and Keller, Equation (6)"
  :precision binary64
  (- (* PI l) (* (/ 1.0 (* F F)) (tan (* PI l)))))