Average Error: 31.8 → 23.0
Time: 13.0s
Precision: binary64
\[{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}\]
\[\begin{array}{l} \mathbf{if}\;\frac{1}{n} \le -1.2267230706287183 \cdot 10^{-6}:\\ \;\;\;\;{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}\\ \mathbf{elif}\;\frac{1}{n} \le 1.27696411941547336 \cdot 10^{-24}:\\ \;\;\;\;\left(\frac{\frac{1}{n}}{x} + 1 \cdot \left(0 - \frac{\log \left(\frac{1}{x}\right)}{x \cdot {n}^{2}}\right)\right) - \frac{\frac{0.5}{n}}{{x}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(x + 1\right)}^{\left(2 \cdot \frac{1}{n}\right)} + \left(-{x}^{\left(2 \cdot \frac{1}{n}\right)}\right)}{{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} + {x}^{\left(\frac{1}{n}\right)}}\\ \end{array}\]

Error

Bits error versus x

Bits error versus n

Derivation

  1. Split input into 3 regimes
  2. if (/ 1.0 n) < -1.2267230706287183e-6

    1. Initial program 1.0

      \[{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}\]

    if -1.2267230706287183e-6 < (/ 1.0 n) < 1.27696411941547336e-24

    1. Initial program 45.1

      \[{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}\]
    2. Using strategy rm
    3. Applied add-log-exp45.1

      \[\leadsto {\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - \color{blue}{\log \left(e^{{x}^{\left(\frac{1}{n}\right)}}\right)}\]
    4. Applied add-log-exp45.1

      \[\leadsto \color{blue}{\log \left(e^{{\left(x + 1\right)}^{\left(\frac{1}{n}\right)}}\right)} - \log \left(e^{{x}^{\left(\frac{1}{n}\right)}}\right)\]
    5. Applied diff-log45.1

      \[\leadsto \color{blue}{\log \left(\frac{e^{{\left(x + 1\right)}^{\left(\frac{1}{n}\right)}}}{e^{{x}^{\left(\frac{1}{n}\right)}}}\right)}\]
    6. Simplified45.1

      \[\leadsto \log \color{blue}{\left(e^{{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}}\right)}\]
    7. Taylor expanded around inf 32.7

      \[\leadsto \color{blue}{\left(1 \cdot \frac{1}{x \cdot n} + 1 \cdot \frac{\log 1}{x \cdot {n}^{2}}\right) - \left(0.5 \cdot \frac{1}{{x}^{2} \cdot n} + 1 \cdot \frac{\log \left(\frac{1}{x}\right)}{x \cdot {n}^{2}}\right)}\]
    8. Simplified32.1

      \[\leadsto \color{blue}{\left(\frac{\frac{1}{n}}{x} + 1 \cdot \left(0 - \frac{\log \left(\frac{1}{x}\right)}{x \cdot {n}^{2}}\right)\right) - \frac{\frac{0.5}{n}}{{x}^{2}}}\]

    if 1.27696411941547336e-24 < (/ 1.0 n)

    1. Initial program 13.1

      \[{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}\]
    2. Using strategy rm
    3. Applied flip--13.1

      \[\leadsto \color{blue}{\frac{{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} \cdot {\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)} \cdot {x}^{\left(\frac{1}{n}\right)}}{{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} + {x}^{\left(\frac{1}{n}\right)}}}\]
    4. Simplified13.0

      \[\leadsto \frac{\color{blue}{{\left(x + 1\right)}^{\left(2 \cdot \frac{1}{n}\right)} + \left(-{x}^{\left(2 \cdot \frac{1}{n}\right)}\right)}}{{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} + {x}^{\left(\frac{1}{n}\right)}}\]
  3. Recombined 3 regimes into one program.
  4. Final simplification23.0

    \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{1}{n} \le -1.2267230706287183 \cdot 10^{-6}:\\ \;\;\;\;{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}\\ \mathbf{elif}\;\frac{1}{n} \le 1.27696411941547336 \cdot 10^{-24}:\\ \;\;\;\;\left(\frac{\frac{1}{n}}{x} + 1 \cdot \left(0 - \frac{\log \left(\frac{1}{x}\right)}{x \cdot {n}^{2}}\right)\right) - \frac{\frac{0.5}{n}}{{x}^{2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{{\left(x + 1\right)}^{\left(2 \cdot \frac{1}{n}\right)} + \left(-{x}^{\left(2 \cdot \frac{1}{n}\right)}\right)}{{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} + {x}^{\left(\frac{1}{n}\right)}}\\ \end{array}\]

Reproduce

herbie shell --seed 2020156 
(FPCore (x n)
  :name "2nthrt (problem 3.4.6)"
  :precision binary64
  (- (pow (+ x 1.0) (/ 1.0 n)) (pow x (/ 1.0 n))))