Average Error: 14.5 → 0.3
Time: 7.6s
Precision: binary64
\[\tan^{-1} \left(N + 1\right) - \tan^{-1} N\]
↓
\[\tan^{-1}_* \frac{1}{1 + \left(N + 1\right) \cdot N}\]
\tan^{-1} \left(N + 1\right) - \tan^{-1} N
↓
\tan^{-1}_* \frac{1}{1 + \left(N + 1\right) \cdot N}
double code(double N) {
	return ((double) (((double) atan(((double) (N + 1.0)))) - ((double) atan(N))));
}
↓
double code(double N) {
	return ((double) atan2(1.0, ((double) (1.0 + ((double) (((double) (N + 1.0)) * N))))));
}

Error

Bits error versus N

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original14.5
Target0.3
Herbie0.3
\[\tan^{-1} \left(\frac{1}{1 + N \cdot \left(N + 1\right)}\right)\]

Derivation

  1. Initial program 14.5

    \[\tan^{-1} \left(N + 1\right) - \tan^{-1} N\]
  2. Using strategy rm

  3. Applied diff-atan13.2

    \[\leadsto \color{blue}{\tan^{-1}_* \frac{\left(N + 1\right) - N}{1 + \left(N + 1\right) \cdot N}}\]

  4. Simplified0.3

    \[\leadsto \tan^{-1}_* \frac{\color{blue}{1}}{1 + \left(N + 1\right) \cdot N}\]

  5. Final simplification0.3

    \[\leadsto \tan^{-1}_* \frac{1}{1 + \left(N + 1\right) \cdot N}\]

Reproduce

herbie shell --seed 2020182 
(FPCore (N)
  :name "2atan (example 3.5)"
  :precision binary64

  :herbie-target
  (atan (/ 1.0 (+ 1.0 (* N (+ N 1.0)))))

  (- (atan (+ N 1.0)) (atan N)))