2nthrt (problem 3.4.6)

Average Error: 32.8 → 1.7

Time: 30.5s

Precision: binary64

Cost: 13380

Math

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

↓

\[\begin{array}{l} t_0 := \frac{\log x}{n}\\ \mathbf{if}\;x \leq 1:\\ \;\;\;\;-\mathsf{expm1}\left(t_0\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{t_0}}{x \cdot n}\\ \end{array} \]

FPCore

(FPCore (x n)
 :precision binary64
 (- (pow (+ x 1.0) (/ 1.0 n)) (pow x (/ 1.0 n))))

↓

(FPCore (x n)
 :precision binary64
 (let* ((t_0 (/ (log x) n)))
   (if (<= x 1.0) (- (expm1 t_0)) (/ (exp t_0) (* x n)))))

C

double code(double x, double n) {
	return pow((x + 1.0), (1.0 / n)) - pow(x, (1.0 / n));
}

↓

double code(double x, double n) {
	double t_0 = log(x) / n;
	double tmp;
	if (x <= 1.0) {
		tmp = -expm1(t_0);
	} else {
		tmp = exp(t_0) / (x * n);
	}
	return tmp;
}

Java

public static double code(double x, double n) {
	return Math.pow((x + 1.0), (1.0 / n)) - Math.pow(x, (1.0 / n));
}

↓

public static double code(double x, double n) {
	double t_0 = Math.log(x) / n;
	double tmp;
	if (x <= 1.0) {
		tmp = -Math.expm1(t_0);
	} else {
		tmp = Math.exp(t_0) / (x * n);
	}
	return tmp;
}

Python

def code(x, n):
	return math.pow((x + 1.0), (1.0 / n)) - math.pow(x, (1.0 / n))

↓

def code(x, n):
	t_0 = math.log(x) / n
	tmp = 0
	if x <= 1.0:
		tmp = -math.expm1(t_0)
	else:
		tmp = math.exp(t_0) / (x * n)
	return tmp

Julia

function code(x, n)
	return Float64((Float64(x + 1.0) ^ Float64(1.0 / n)) - (x ^ Float64(1.0 / n)))
end

↓

function code(x, n)
	t_0 = Float64(log(x) / n)
	tmp = 0.0
	if (x <= 1.0)
		tmp = Float64(-expm1(t_0));
	else
		tmp = Float64(exp(t_0) / Float64(x * n));
	end
	return tmp
end

Wolfram

code[x_, n_] := N[(N[Power[N[(x + 1.0), $MachinePrecision], N[(1.0 / n), $MachinePrecision]], $MachinePrecision] - N[Power[x, N[(1.0 / n), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

↓

code[x_, n_] := Block[{t$95$0 = N[(N[Log[x], $MachinePrecision] / n), $MachinePrecision]}, If[LessEqual[x, 1.0], (-N[(Exp[t$95$0] - 1), $MachinePrecision]), N[(N[Exp[t$95$0], $MachinePrecision] / N[(x * n), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 47.4

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

   2. Taylor expanded in n around 0 47.4

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

   3. Simplified 46.8

      \[\leadsto \color{blue}{e^{\frac{\mathsf{log1p}\left(x\right)}{n}}} - {x}^{\left(\frac{1}{n}\right)} \]
      Proof
      (exp.f64 (/.f64 (log1p.f64 x) n)): 0 points increase in error, 0 points decrease in error
      (exp.f64 (/.f64 (Rewrite<= log1p-def_binary64 (log.f64 (+.f64 1 x))) n)): 3 points increase in error, 0 points decrease in error

   4. Taylor expanded in x around 0 46.8

      \[\leadsto e^{\color{blue}{\frac{x}{n}}} - {x}^{\left(\frac{1}{n}\right)} \]

   5. Taylor expanded in x around 0 47.4

      \[\leadsto \color{blue}{1 - e^{\frac{\log x}{n}}} \]

   6. Simplified 1.8

      \[\leadsto \color{blue}{-\mathsf{expm1}\left(\frac{\log x}{n}\right)} \]
      Proof
      (neg.f64 (expm1.f64 (/.f64 (log.f64 x) n))): 0 points increase in error, 0 points decrease in error
      (neg.f64 (Rewrite<= expm1-def_binary64 (-.f64 (exp.f64 (/.f64 (log.f64 x) n)) 1))): 101 points increase in error, 78 points decrease in error
      (Rewrite<= sub0-neg_binary64 (-.f64 0 (-.f64 (exp.f64 (/.f64 (log.f64 x) n)) 1))): 0 points increase in error, 0 points decrease in error
      (-.f64 (Rewrite<= metadata-eval (log.f64 1)) (-.f64 (exp.f64 (/.f64 (log.f64 x) n)) 1)): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-+l-_binary64 (+.f64 (-.f64 (log.f64 1) (exp.f64 (/.f64 (log.f64 x) n))) 1)): 0 points increase in error, 0 points decrease in error
      (+.f64 (-.f64 (Rewrite=> metadata-eval 0) (exp.f64 (/.f64 (log.f64 x) n))) 1): 0 points increase in error, 0 points decrease in error
      (+.f64 (Rewrite<= neg-sub0_binary64 (neg.f64 (exp.f64 (/.f64 (log.f64 x) n)))) 1): 0 points increase in error, 0 points decrease in error
      (Rewrite<= +-commutative_binary64 (+.f64 1 (neg.f64 (exp.f64 (/.f64 (log.f64 x) n))))): 0 points increase in error, 0 points decrease in error
      (Rewrite<= sub-neg_binary64 (-.f64 1 (exp.f64 (/.f64 (log.f64 x) n)))): 0 points increase in error, 0 points decrease in error

   if 1 < x

   1. Initial program 20.9

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

   2. Taylor expanded in n around 0 21.0

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

   3. Simplified 21.0

      \[\leadsto \color{blue}{e^{\frac{\mathsf{log1p}\left(x\right)}{n}}} - {x}^{\left(\frac{1}{n}\right)} \]
      Proof
      (exp.f64 (/.f64 (log1p.f64 x) n)): 0 points increase in error, 0 points decrease in error
      (exp.f64 (/.f64 (Rewrite<= log1p-def_binary64 (log.f64 (+.f64 1 x))) n)): 3 points increase in error, 0 points decrease in error

   4. Taylor expanded in x around inf 1.6

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

   5. Simplified 1.6

      \[\leadsto \color{blue}{\frac{e^{\frac{\log x}{n}}}{x \cdot n}} \]
      Proof
      (/.f64 (exp.f64 (/.f64 (log.f64 x) n)) (*.f64 x n)): 0 points increase in error, 0 points decrease in error
      (/.f64 (exp.f64 (/.f64 (Rewrite<= remove-double-neg_binary64 (neg.f64 (neg.f64 (log.f64 x)))) n)) (*.f64 x n)): 0 points increase in error, 0 points decrease in error
      (/.f64 (exp.f64 (/.f64 (neg.f64 (Rewrite<= mul-1-neg_binary64 (*.f64 -1 (log.f64 x)))) n)) (*.f64 x n)): 0 points increase in error, 0 points decrease in error
      (/.f64 (exp.f64 (Rewrite<= distribute-neg-frac_binary64 (neg.f64 (/.f64 (*.f64 -1 (log.f64 x)) n)))) (*.f64 x n)): 0 points increase in error, 0 points decrease in error
      (/.f64 (exp.f64 (neg.f64 (/.f64 (Rewrite=> mul-1-neg_binary64 (neg.f64 (log.f64 x))) n))) (*.f64 x n)): 0 points increase in error, 0 points decrease in error
      (/.f64 (exp.f64 (neg.f64 (/.f64 (Rewrite<= log-rec_binary64 (log.f64 (/.f64 1 x))) n))) (*.f64 x n)): 0 points increase in error, 0 points decrease in error
      (/.f64 (exp.f64 (Rewrite<= mul-1-neg_binary64 (*.f64 -1 (/.f64 (log.f64 (/.f64 1 x)) n)))) (*.f64 x n)): 0 points increase in error, 0 points decrease in error
      (/.f64 (exp.f64 (*.f64 -1 (/.f64 (log.f64 (/.f64 1 x)) n))) (Rewrite<= *-commutative_binary64 (*.f64 n x))): 0 points increase in error, 0 points decrease in error
3. Recombined 2 regimes into one program.

4. Final simplification 1.7

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;-\mathsf{expm1}\left(\frac{\log x}{n}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{\frac{\log x}{n}}}{x \cdot n}\\ \end{array} \]

Alternatives

Alternative 1
Error	1.7
Cost	13188

\[\begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;-\mathsf{expm1}\left(\frac{\log x}{n}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{x \cdot n}{{x}^{\left(\frac{1}{n}\right)}}}\\ \end{array} \]

Alternative 2
Error	23.0
Cost	9644

\[\begin{array}{l} t_0 := -\frac{\log x}{n}\\ t_1 := \frac{1}{n \cdot \left(x + 0.5\right)}\\ t_2 := \frac{x - \log x}{n}\\ \mathbf{if}\;\frac{1}{n} \leq -2 \cdot 10^{-17}:\\ \;\;\;\;0\\ \mathbf{elif}\;\frac{1}{n} \leq -2 \cdot 10^{-70}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;\frac{1}{n} \leq -1 \cdot 10^{-145}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{1}{n} \leq -2 \cdot 10^{-277}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;\frac{1}{n} \leq 2 \cdot 10^{-285}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{1}{n} \leq 2 \cdot 10^{-238}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq 3 \cdot 10^{-223}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{1}{n} \leq 5 \cdot 10^{-101}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq 5 \cdot 10^{-69}:\\ \;\;\;\;\frac{\frac{1}{x}}{n}\\ \mathbf{elif}\;\frac{1}{n} \leq 5 \cdot 10^{-50}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;\frac{1}{n} \leq 5 \cdot 10^{-12}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;1 - {x}^{\left(\frac{1}{n}\right)}\\ \end{array} \]

Alternative 3
Error	11.5
Cost	9108

\[\begin{array}{l} t_0 := \frac{\log \left(\frac{x + 1}{x}\right)}{n}\\ t_1 := {x}^{\left(\frac{1}{n}\right)}\\ \mathbf{if}\;\frac{1}{n} \leq -2 \cdot 10^{-17}:\\ \;\;\;\;\frac{1}{\frac{x \cdot n}{t_1}}\\ \mathbf{elif}\;\frac{1}{n} \leq -1 \cdot 10^{-123}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq -1 \cdot 10^{-142}:\\ \;\;\;\;\frac{\frac{1}{x}}{n}\\ \mathbf{elif}\;\frac{1}{n} \leq 10^{-43}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq 0.5:\\ \;\;\;\;\frac{1}{\frac{n}{\frac{t_1}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \left(\frac{x}{n} + \left(x \cdot \frac{x}{n}\right) \cdot \left(\frac{0.5}{n} + -0.5\right)\right)\right) - t_1\\ \end{array} \]

Alternative 4
Error	11.7
Cost	8340

\[\begin{array}{l} t_0 := \frac{\log \left(\frac{x + 1}{x}\right)}{n}\\ t_1 := {x}^{\left(\frac{1}{n}\right)}\\ \mathbf{if}\;\frac{1}{n} \leq -2 \cdot 10^{-17}:\\ \;\;\;\;\frac{1}{\frac{x \cdot n}{t_1}}\\ \mathbf{elif}\;\frac{1}{n} \leq -1 \cdot 10^{-123}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq -1 \cdot 10^{-142}:\\ \;\;\;\;\frac{\frac{1}{x}}{n}\\ \mathbf{elif}\;\frac{1}{n} \leq 10^{-43}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq 0.5:\\ \;\;\;\;\frac{1}{\frac{n}{\frac{t_1}{x}}}\\ \mathbf{else}:\\ \;\;\;\;1 - t_1\\ \end{array} \]

Alternative 5
Error	11.6
Cost	8340

\[\begin{array}{l} t_0 := \frac{\log \left(\frac{x + 1}{x}\right)}{n}\\ t_1 := {x}^{\left(\frac{1}{n}\right)}\\ \mathbf{if}\;\frac{1}{n} \leq -2 \cdot 10^{-17}:\\ \;\;\;\;\frac{1}{\frac{x \cdot n}{t_1}}\\ \mathbf{elif}\;\frac{1}{n} \leq -1 \cdot 10^{-123}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq -1 \cdot 10^{-142}:\\ \;\;\;\;\frac{\frac{1}{x}}{n}\\ \mathbf{elif}\;\frac{1}{n} \leq 10^{-43}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq 0.5:\\ \;\;\;\;\frac{1}{\frac{n}{\frac{t_1}{x}}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{x}{n}\right) - t_1\\ \end{array} \]

Alternative 6
Error	11.7
Cost	7832

\[\begin{array}{l} t_0 := \frac{\log \left(\frac{x + 1}{x}\right)}{n}\\ t_1 := {x}^{\left(\frac{1}{n}\right)}\\ t_2 := \frac{1}{\frac{x \cdot n}{t_1}}\\ \mathbf{if}\;n \leq -2.1000573131211667 \cdot 10^{+146}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;n \leq -1.1822156105888521 \cdot 10^{+123}:\\ \;\;\;\;\frac{\frac{1}{x}}{n}\\ \mathbf{elif}\;n \leq -444958424000968300:\\ \;\;\;\;t_0\\ \mathbf{elif}\;n \leq 0:\\ \;\;\;\;t_2\\ \mathbf{elif}\;n \leq 0.21041960038258173:\\ \;\;\;\;1 - t_1\\ \mathbf{elif}\;n \leq 2.0640561085583733 \cdot 10^{+42}:\\ \;\;\;\;t_2\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 7
Error	12.6
Cost	7824

\[\begin{array}{l} t_0 := \frac{\log \left(\frac{x + 1}{x}\right)}{n}\\ \mathbf{if}\;\frac{1}{n} \leq -1 \cdot 10^{-123}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq -1 \cdot 10^{-142}:\\ \;\;\;\;\frac{\frac{1}{x}}{n}\\ \mathbf{elif}\;\frac{1}{n} \leq 5 \cdot 10^{-50}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;\frac{1}{n} \leq 5 \cdot 10^{-12}:\\ \;\;\;\;\frac{1}{n \cdot \left(x + 0.5\right)}\\ \mathbf{else}:\\ \;\;\;\;1 - {x}^{\left(\frac{1}{n}\right)}\\ \end{array} \]

Alternative 8
Error	15.6
Cost	6852

\[\begin{array}{l} \mathbf{if}\;x \leq 6.5 \cdot 10^{-7}:\\ \;\;\;\;\frac{x - \log x}{n}\\ \mathbf{elif}\;x \leq 3.6 \cdot 10^{+164}:\\ \;\;\;\;\frac{\frac{1}{x} + \frac{\frac{-0.5}{x}}{x}}{n}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 9
Error	15.7
Cost	6788

\[\begin{array}{l} \mathbf{if}\;x \leq 6.5 \cdot 10^{-7}:\\ \;\;\;\;-\frac{\log x}{n}\\ \mathbf{elif}\;x \leq 3.6 \cdot 10^{+164}:\\ \;\;\;\;\frac{\frac{1}{x} + \frac{\frac{-0.5}{x}}{x}}{n}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 10
Error	26.4
Cost	708

\[\begin{array}{l} \mathbf{if}\;\frac{1}{n} \leq -0.2:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{n \cdot \left(x + 0.5\right)}\\ \end{array} \]

Alternative 11
Error	28.9
Cost	584

\[\begin{array}{l} t_0 := \frac{1}{x \cdot n}\\ \mathbf{if}\;n \leq -45.745967418110155:\\ \;\;\;\;t_0\\ \mathbf{elif}\;n \leq 1.4 \cdot 10^{-43}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 12
Error	28.5
Cost	584

\[\begin{array}{l} t_0 := \frac{\frac{1}{x}}{n}\\ \mathbf{if}\;n \leq -45.745967418110155:\\ \;\;\;\;t_0\\ \mathbf{elif}\;n \leq 1.4 \cdot 10^{-43}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 13
Error	39.0
Cost	64

\[0 \]

Reproduce

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