Average Error: 32.9 → 23.3
Time: 57.1s
Precision: 64
Internal Precision: 1344
\[{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}\]
\[\begin{array}{l} \mathbf{if}\;n \le -58186829.78451726 \lor \neg \left(n \le 13035341.089849701\right):\\ \;\;\;\;\frac{\frac{\frac{-1}{2}}{x}}{x \cdot n} + \left(\frac{\log x}{n \cdot \left(x \cdot n\right)} + \frac{\frac{1}{x}}{n}\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(e^{\sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}} \cdot \sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}}}\right) \cdot \sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}}\\ \end{array}\]

Error

Bits error versus x

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Split input into 2 regimes
  2. if n < -58186829.78451726 or 13035341.089849701 < n

    1. Initial program 45.2

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

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

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

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

      \[\leadsto e^{\color{blue}{\frac{\log_* (1 + x)}{n}}} - {x}^{\left(\frac{1}{n}\right)}\]
    7. Using strategy rm
    8. Applied add-cbrt-cube45.2

      \[\leadsto \color{blue}{\sqrt[3]{\left(\left(e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}\right) \cdot \left(e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}\right)\right) \cdot \left(e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}\right)}}\]
    9. Taylor expanded around -inf 63.0

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

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

    if -58186829.78451726 < n < 13035341.089849701

    1. Initial program 3.3

      \[{\left(x + 1\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}\]
    2. Initial simplification3.3

      \[\leadsto {\left(1 + x\right)}^{\left(\frac{1}{n}\right)} - {x}^{\left(\frac{1}{n}\right)}\]
    3. Using strategy rm
    4. Applied add-exp-log3.4

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

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

      \[\leadsto e^{\color{blue}{\frac{\log_* (1 + x)}{n}}} - {x}^{\left(\frac{1}{n}\right)}\]
    7. Using strategy rm
    8. Applied add-log-exp2.4

      \[\leadsto \color{blue}{\log \left(e^{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}}\right)}\]
    9. Using strategy rm
    10. Applied add-cube-cbrt2.5

      \[\leadsto \log \left(e^{\color{blue}{\left(\sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}} \cdot \sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}}\right) \cdot \sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}}}}\right)\]
    11. Applied exp-prod2.5

      \[\leadsto \log \color{blue}{\left({\left(e^{\sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}} \cdot \sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}}}\right)}^{\left(\sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}}\right)}\right)}\]
    12. Applied log-pow2.4

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

    \[\leadsto \begin{array}{l} \mathbf{if}\;n \le -58186829.78451726 \lor \neg \left(n \le 13035341.089849701\right):\\ \;\;\;\;\frac{\frac{\frac{-1}{2}}{x}}{x \cdot n} + \left(\frac{\log x}{n \cdot \left(x \cdot n\right)} + \frac{\frac{1}{x}}{n}\right)\\ \mathbf{else}:\\ \;\;\;\;\log \left(e^{\sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}} \cdot \sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}}}\right) \cdot \sqrt[3]{e^{\frac{\log_* (1 + x)}{n}} - {x}^{\left(\frac{1}{n}\right)}}\\ \end{array}\]

Runtime

Time bar (total: 57.1s)Debug logProfile

BaselineHerbieOracleSpan%
Regimes32.623.321.910.786.6%
herbie shell --seed 2018296 +o rules:numerics
(FPCore (x n)
  :name "2nthrt (problem 3.4.6)"
  (- (pow (+ x 1) (/ 1 n)) (pow x (/ 1 n))))