Average Error: 16.6 → 12.6
Time: 7.8s
Precision: binary64
\[\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)\]
↓
\[\pi \cdot \ell - 1 \cdot \left(\frac{1}{F} \cdot \frac{\tan \left(\pi \cdot \ell\right)}{F}\right)\]
\pi \cdot \ell - \frac{1}{F \cdot F} \cdot \tan \left(\pi \cdot \ell\right)
↓
\pi \cdot \ell - 1 \cdot \left(\frac{1}{F} \cdot \frac{\tan \left(\pi \cdot \ell\right)}{F}\right)
double code(double F, double l) {
	return ((double) (((double) (((double) M_PI) * l)) - ((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 / F) * (((double) tan(((double) (((double) M_PI) * l)))) / F)))))));
}

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.6

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

  2. Simplified16.3

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

  4. Applied *-un-lft-identity16.3

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

  5. Applied times-frac12.6

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

  6. Final simplification12.6

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

Reproduce

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