Compound Interest

Percentage Accurate: 27.6% → 94.1%

Time: 12.6s

Alternatives: 15

Speedup: 8.1×

• could not determine a ground truth

  1. i = 9.000057320118417e-102
  2. n = 1.0330356043019261e+39

Specification

Math

\[\begin{array}{l} \\ 100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (* 100.0 (/ (- (pow (+ 1.0 (/ i n)) n) 1.0) (/ i n))))

C

double code(double i, double n) {
	return 100.0 * ((pow((1.0 + (i / n)), n) - 1.0) / (i / n));
}

Fortran

real(8) function code(i, n)
    real(8), intent (in) :: i
    real(8), intent (in) :: n
    code = 100.0d0 * ((((1.0d0 + (i / n)) ** n) - 1.0d0) / (i / n))
end function

Java

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

Python

def code(i, n):
	return 100.0 * ((math.pow((1.0 + (i / n)), n) - 1.0) / (i / n))

Julia

function code(i, n)
	return Float64(100.0 * Float64(Float64((Float64(1.0 + Float64(i / n)) ^ n) - 1.0) / Float64(i / n)))
end

MATLAB

function tmp = code(i, n)
	tmp = 100.0 * ((((1.0 + (i / n)) ^ n) - 1.0) / (i / n));
end

Wolfram

code[i_, n_] := N[(100.0 * N[(N[(N[Power[N[(1.0 + N[(i / n), $MachinePrecision]), $MachinePrecision], n], $MachinePrecision] - 1.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 27.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (* 100.0 (/ (- (pow (+ 1.0 (/ i n)) n) 1.0) (/ i n))))

C

double code(double i, double n) {
	return 100.0 * ((pow((1.0 + (i / n)), n) - 1.0) / (i / n));
}

Fortran

real(8) function code(i, n)
    real(8), intent (in) :: i
    real(8), intent (in) :: n
    code = 100.0d0 * ((((1.0d0 + (i / n)) ** n) - 1.0d0) / (i / n))
end function

Java

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

Python

def code(i, n):
	return 100.0 * ((math.pow((1.0 + (i / n)), n) - 1.0) / (i / n))

Julia

function code(i, n)
	return Float64(100.0 * Float64(Float64((Float64(1.0 + Float64(i / n)) ^ n) - 1.0) / Float64(i / n)))
end

MATLAB

function tmp = code(i, n)
	tmp = 100.0 * ((((1.0 + (i / n)) ^ n) - 1.0) / (i / n));
end

Wolfram

code[i_, n_] := N[(100.0 * N[(N[(N[Power[N[(1.0 + N[(i / n), $MachinePrecision]), $MachinePrecision], n], $MachinePrecision] - 1.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 94.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(\frac{i}{n} + 1\right)}^{n}\\ t_1 := \frac{t\_0 - 1}{\frac{i}{n}}\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;\frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right) \cdot 100}{\frac{i}{n}}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{t\_0}{i}, n, \frac{-n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(n, i, 0\right)}{i} \cdot 100\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (pow (+ (/ i n) 1.0) n)) (t_1 (/ (- t_0 1.0) (/ i n))))
   (if (<= t_1 0.0)
     (/ (* (expm1 (* (log1p (/ i n)) n)) 100.0) (/ i n))
     (if (<= t_1 INFINITY)
       (* (fma (/ t_0 i) n (/ (- n) i)) 100.0)
       (* (/ (fma n i 0.0) i) 100.0)))))

C

double code(double i, double n) {
	double t_0 = pow(((i / n) + 1.0), n);
	double t_1 = (t_0 - 1.0) / (i / n);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = (expm1((log1p((i / n)) * n)) * 100.0) / (i / n);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = fma((t_0 / i), n, (-n / i)) * 100.0;
	} else {
		tmp = (fma(n, i, 0.0) / i) * 100.0;
	}
	return tmp;
}

Julia

function code(i, n)
	t_0 = Float64(Float64(i / n) + 1.0) ^ n
	t_1 = Float64(Float64(t_0 - 1.0) / Float64(i / n))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = Float64(Float64(expm1(Float64(log1p(Float64(i / n)) * n)) * 100.0) / Float64(i / n));
	elseif (t_1 <= Inf)
		tmp = Float64(fma(Float64(t_0 / i), n, Float64(Float64(-n) / i)) * 100.0);
	else
		tmp = Float64(Float64(fma(n, i, 0.0) / i) * 100.0);
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[Power[N[(N[(i / n), $MachinePrecision] + 1.0), $MachinePrecision], n], $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 - 1.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[(N[(Exp[N[(N[Log[1 + N[(i / n), $MachinePrecision]], $MachinePrecision] * n), $MachinePrecision]] - 1), $MachinePrecision] * 100.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(t$95$0 / i), $MachinePrecision] * n + N[((-n) / i), $MachinePrecision]), $MachinePrecision] * 100.0), $MachinePrecision], N[(N[(N[(n * i + 0.0), $MachinePrecision] / i), $MachinePrecision] * 100.0), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (pow.f64 (+.f64 #s(literal 1 binary64) (/.f64 i n)) n) #s(literal 1 binary64)) (/.f64 i n)) < -0.0

   1. Initial program 28.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      3. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}{\frac{i}{n}}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}{\frac{i}{n}}} \]

      5. lower-*.f64 28.2

         \[\leadsto \frac{\color{blue}{100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}}{\frac{i}{n}} \]

      6. lift--.f64 N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}}{\frac{i}{n}} \]

      7. lift-pow.f64 N/A

         \[\leadsto \frac{100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n}} - 1\right)}{\frac{i}{n}} \]

      8. pow-to-exp N/A

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

      9. lower-expm1.f64 N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\mathsf{expm1}\left(\log \left(1 + \frac{i}{n}\right) \cdot n\right)}}{\frac{i}{n}} \]

      10. lower-*.f64 N/A

          \[\leadsto \frac{100 \cdot \mathsf{expm1}\left(\color{blue}{\log \left(1 + \frac{i}{n}\right) \cdot n}\right)}{\frac{i}{n}} \]

      11. lift-+.f64 N/A

          \[\leadsto \frac{100 \cdot \mathsf{expm1}\left(\log \color{blue}{\left(1 + \frac{i}{n}\right)} \cdot n\right)}{\frac{i}{n}} \]

      12. lower-log1p.f64 98.1

          \[\leadsto \frac{100 \cdot \mathsf{expm1}\left(\color{blue}{\mathsf{log1p}\left(\frac{i}{n}\right)} \cdot n\right)}{\frac{i}{n}} \]

   4. Applied rewrites 98.1%

      \[\leadsto \color{blue}{\frac{100 \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)}{\frac{i}{n}}} \]

   if -0.0 < (/.f64 (-.f64 (pow.f64 (+.f64 #s(literal 1 binary64) (/.f64 i n)) n) #s(literal 1 binary64)) (/.f64 i n)) < +inf.0

   1. Initial program 98.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. associate-/r/ N/A

         \[\leadsto 100 \cdot \left(\color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{i} \cdot n} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. lower-fma.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      10. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{i}}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      15. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-neg.f64 98.3

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 98.3%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \frac{-n}{i}\right)} \]

   if +inf.0 < (/.f64 (-.f64 (pow.f64 (+.f64 #s(literal 1 binary64) (/.f64 i n)) n) #s(literal 1 binary64)) (/.f64 i n))

   1. Initial program 0.0%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 0.0

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 0.0%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto 100 \cdot \color{blue}{\frac{n + \left(-1 \cdot n + i \cdot n\right)}{i}} \]
   6. Step-by-step derivation

      1. associate-+r+ N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(n + -1 \cdot n\right) + i \cdot n}}{i} \]

      2. distribute-rgt1-in N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(-1 + 1\right) \cdot n} + i \cdot n}{i} \]

      3. metadata-eval N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{0} \cdot n + i \cdot n}{i} \]

      4. mul0-lft N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{0} + i \cdot n}{i} \]

      5. lower-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{0 + i \cdot n}{i}} \]

      6. mul0-lft N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{0 \cdot n} + i \cdot n}{i} \]

      7. metadata-eval N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(-1 + 1\right)} \cdot n + i \cdot n}{i} \]

      8. distribute-rgt1-in N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(n + -1 \cdot n\right)} + i \cdot n}{i} \]

      9. associate-+r+ N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{n + \left(-1 \cdot n + i \cdot n\right)}}{i} \]

      10. +-commutative N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{\left(-1 \cdot n + i \cdot n\right) + n}}{i} \]

      11. +-commutative N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{\left(i \cdot n + -1 \cdot n\right)} + n}{i} \]

      12. associate-+r+ N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{i \cdot n + \left(-1 \cdot n + n\right)}}{i} \]

      13. *-commutative N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{n \cdot i} + \left(-1 \cdot n + n\right)}{i} \]

      14. distribute-lft1-in N/A

          \[\leadsto 100 \cdot \frac{n \cdot i + \color{blue}{\left(-1 + 1\right) \cdot n}}{i} \]

      15. metadata-eval N/A

          \[\leadsto 100 \cdot \frac{n \cdot i + \color{blue}{0} \cdot n}{i} \]

      16. mul0-lft N/A

          \[\leadsto 100 \cdot \frac{n \cdot i + \color{blue}{0}}{i} \]

      17. lower-fma.f64 84.5

          \[\leadsto 100 \cdot \frac{\color{blue}{\mathsf{fma}\left(n, i, 0\right)}}{i} \]

   7. Applied rewrites 84.5%

      \[\leadsto 100 \cdot \color{blue}{\frac{\mathsf{fma}\left(n, i, 0\right)}{i}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 96.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{{\left(\frac{i}{n} + 1\right)}^{n} - 1}{\frac{i}{n}} \leq 0:\\ \;\;\;\;\frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right) \cdot 100}{\frac{i}{n}}\\ \mathbf{elif}\;\frac{{\left(\frac{i}{n} + 1\right)}^{n} - 1}{\frac{i}{n}} \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \frac{-n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(n, i, 0\right)}{i} \cdot 100\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 93.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(\frac{i}{n} + 1\right)}^{n}\\ t_1 := \frac{t\_0 - 1}{\frac{i}{n}}\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;\left(100 \cdot n\right) \cdot \frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)}{i}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{t\_0}{i}, n, \frac{-n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(n, i, 0\right)}{i} \cdot 100\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (pow (+ (/ i n) 1.0) n)) (t_1 (/ (- t_0 1.0) (/ i n))))
   (if (<= t_1 0.0)
     (* (* 100.0 n) (/ (expm1 (* (log1p (/ i n)) n)) i))
     (if (<= t_1 INFINITY)
       (* (fma (/ t_0 i) n (/ (- n) i)) 100.0)
       (* (/ (fma n i 0.0) i) 100.0)))))

C

double code(double i, double n) {
	double t_0 = pow(((i / n) + 1.0), n);
	double t_1 = (t_0 - 1.0) / (i / n);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = (100.0 * n) * (expm1((log1p((i / n)) * n)) / i);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = fma((t_0 / i), n, (-n / i)) * 100.0;
	} else {
		tmp = (fma(n, i, 0.0) / i) * 100.0;
	}
	return tmp;
}

Julia

function code(i, n)
	t_0 = Float64(Float64(i / n) + 1.0) ^ n
	t_1 = Float64(Float64(t_0 - 1.0) / Float64(i / n))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = Float64(Float64(100.0 * n) * Float64(expm1(Float64(log1p(Float64(i / n)) * n)) / i));
	elseif (t_1 <= Inf)
		tmp = Float64(fma(Float64(t_0 / i), n, Float64(Float64(-n) / i)) * 100.0);
	else
		tmp = Float64(Float64(fma(n, i, 0.0) / i) * 100.0);
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[Power[N[(N[(i / n), $MachinePrecision] + 1.0), $MachinePrecision], n], $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 - 1.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[(100.0 * n), $MachinePrecision] * N[(N[(Exp[N[(N[Log[1 + N[(i / n), $MachinePrecision]], $MachinePrecision] * n), $MachinePrecision]] - 1), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(t$95$0 / i), $MachinePrecision] * n + N[((-n) / i), $MachinePrecision]), $MachinePrecision] * 100.0), $MachinePrecision], N[(N[(N[(n * i + 0.0), $MachinePrecision] / i), $MachinePrecision] * 100.0), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (pow.f64 (+.f64 #s(literal 1 binary64) (/.f64 i n)) n) #s(literal 1 binary64)) (/.f64 i n)) < -0.0

   1. Initial program 28.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \cdot 100 \]

      4. lift-/.f64 N/A

         \[\leadsto \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\color{blue}{\frac{i}{n}}} \cdot 100 \]

      5. associate-/r/ N/A

         \[\leadsto \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i} \cdot n\right)} \cdot 100 \]

      6. associate-*l* N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i} \cdot \left(n \cdot 100\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i} \cdot \left(n \cdot 100\right)} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i}} \cdot \left(n \cdot 100\right) \]

      9. lift--.f64 N/A

         \[\leadsto \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{i} \cdot \left(n \cdot 100\right) \]

      10. lift-pow.f64 N/A

          \[\leadsto \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n}} - 1}{i} \cdot \left(n \cdot 100\right) \]

      11. pow-to-exp N/A

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

      12. lower-expm1.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{expm1}\left(\log \left(1 + \frac{i}{n}\right) \cdot n\right)}}{i} \cdot \left(n \cdot 100\right) \]

      13. lower-*.f64 N/A

          \[\leadsto \frac{\mathsf{expm1}\left(\color{blue}{\log \left(1 + \frac{i}{n}\right) \cdot n}\right)}{i} \cdot \left(n \cdot 100\right) \]

      14. lift-+.f64 N/A

          \[\leadsto \frac{\mathsf{expm1}\left(\log \color{blue}{\left(1 + \frac{i}{n}\right)} \cdot n\right)}{i} \cdot \left(n \cdot 100\right) \]

      15. lower-log1p.f64 N/A

          \[\leadsto \frac{\mathsf{expm1}\left(\color{blue}{\mathsf{log1p}\left(\frac{i}{n}\right)} \cdot n\right)}{i} \cdot \left(n \cdot 100\right) \]

      16. *-commutative N/A

          \[\leadsto \frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)}{i} \cdot \color{blue}{\left(100 \cdot n\right)} \]

      17. lower-*.f64 97.1

          \[\leadsto \frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)}{i} \cdot \color{blue}{\left(100 \cdot n\right)} \]

   4. Applied rewrites 97.1%

      \[\leadsto \color{blue}{\frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)}{i} \cdot \left(100 \cdot n\right)} \]

   if -0.0 < (/.f64 (-.f64 (pow.f64 (+.f64 #s(literal 1 binary64) (/.f64 i n)) n) #s(literal 1 binary64)) (/.f64 i n)) < +inf.0

   1. Initial program 98.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. associate-/r/ N/A

         \[\leadsto 100 \cdot \left(\color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{i} \cdot n} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. lower-fma.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      10. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{i}}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      15. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-neg.f64 98.3

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 98.3%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \frac{-n}{i}\right)} \]

   if +inf.0 < (/.f64 (-.f64 (pow.f64 (+.f64 #s(literal 1 binary64) (/.f64 i n)) n) #s(literal 1 binary64)) (/.f64 i n))

   1. Initial program 0.0%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 0.0

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 0.0%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto 100 \cdot \color{blue}{\frac{n + \left(-1 \cdot n + i \cdot n\right)}{i}} \]
   6. Step-by-step derivation

      1. associate-+r+ N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(n + -1 \cdot n\right) + i \cdot n}}{i} \]

      2. distribute-rgt1-in N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(-1 + 1\right) \cdot n} + i \cdot n}{i} \]

      3. metadata-eval N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{0} \cdot n + i \cdot n}{i} \]

      4. mul0-lft N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{0} + i \cdot n}{i} \]

      5. lower-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{0 + i \cdot n}{i}} \]

      6. mul0-lft N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{0 \cdot n} + i \cdot n}{i} \]

      7. metadata-eval N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(-1 + 1\right)} \cdot n + i \cdot n}{i} \]

      8. distribute-rgt1-in N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(n + -1 \cdot n\right)} + i \cdot n}{i} \]

      9. associate-+r+ N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{n + \left(-1 \cdot n + i \cdot n\right)}}{i} \]

      10. +-commutative N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{\left(-1 \cdot n + i \cdot n\right) + n}}{i} \]

      11. +-commutative N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{\left(i \cdot n + -1 \cdot n\right)} + n}{i} \]

      12. associate-+r+ N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{i \cdot n + \left(-1 \cdot n + n\right)}}{i} \]

      13. *-commutative N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{n \cdot i} + \left(-1 \cdot n + n\right)}{i} \]

      14. distribute-lft1-in N/A

          \[\leadsto 100 \cdot \frac{n \cdot i + \color{blue}{\left(-1 + 1\right) \cdot n}}{i} \]

      15. metadata-eval N/A

          \[\leadsto 100 \cdot \frac{n \cdot i + \color{blue}{0} \cdot n}{i} \]

      16. mul0-lft N/A

          \[\leadsto 100 \cdot \frac{n \cdot i + \color{blue}{0}}{i} \]

      17. lower-fma.f64 84.5

          \[\leadsto 100 \cdot \frac{\color{blue}{\mathsf{fma}\left(n, i, 0\right)}}{i} \]

   7. Applied rewrites 84.5%

      \[\leadsto 100 \cdot \color{blue}{\frac{\mathsf{fma}\left(n, i, 0\right)}{i}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 95.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{{\left(\frac{i}{n} + 1\right)}^{n} - 1}{\frac{i}{n}} \leq 0:\\ \;\;\;\;\left(100 \cdot n\right) \cdot \frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)}{i}\\ \mathbf{elif}\;\frac{{\left(\frac{i}{n} + 1\right)}^{n} - 1}{\frac{i}{n}} \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \frac{-n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(n, i, 0\right)}{i} \cdot 100\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 93.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(\frac{i}{n} + 1\right)}^{n}\\ t_1 := \frac{t\_0 - 1}{\frac{i}{n}}\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;\left(\frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)}{i} \cdot n\right) \cdot 100\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{t\_0}{i}, n, \frac{-n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(n, i, 0\right)}{i} \cdot 100\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (pow (+ (/ i n) 1.0) n)) (t_1 (/ (- t_0 1.0) (/ i n))))
   (if (<= t_1 0.0)
     (* (* (/ (expm1 (* (log1p (/ i n)) n)) i) n) 100.0)
     (if (<= t_1 INFINITY)
       (* (fma (/ t_0 i) n (/ (- n) i)) 100.0)
       (* (/ (fma n i 0.0) i) 100.0)))))

C

double code(double i, double n) {
	double t_0 = pow(((i / n) + 1.0), n);
	double t_1 = (t_0 - 1.0) / (i / n);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = ((expm1((log1p((i / n)) * n)) / i) * n) * 100.0;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = fma((t_0 / i), n, (-n / i)) * 100.0;
	} else {
		tmp = (fma(n, i, 0.0) / i) * 100.0;
	}
	return tmp;
}

Julia

function code(i, n)
	t_0 = Float64(Float64(i / n) + 1.0) ^ n
	t_1 = Float64(Float64(t_0 - 1.0) / Float64(i / n))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = Float64(Float64(Float64(expm1(Float64(log1p(Float64(i / n)) * n)) / i) * n) * 100.0);
	elseif (t_1 <= Inf)
		tmp = Float64(fma(Float64(t_0 / i), n, Float64(Float64(-n) / i)) * 100.0);
	else
		tmp = Float64(Float64(fma(n, i, 0.0) / i) * 100.0);
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[Power[N[(N[(i / n), $MachinePrecision] + 1.0), $MachinePrecision], n], $MachinePrecision]}, Block[{t$95$1 = N[(N[(t$95$0 - 1.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[(N[(N[(Exp[N[(N[Log[1 + N[(i / n), $MachinePrecision]], $MachinePrecision] * n), $MachinePrecision]] - 1), $MachinePrecision] / i), $MachinePrecision] * n), $MachinePrecision] * 100.0), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(t$95$0 / i), $MachinePrecision] * n + N[((-n) / i), $MachinePrecision]), $MachinePrecision] * 100.0), $MachinePrecision], N[(N[(N[(n * i + 0.0), $MachinePrecision] / i), $MachinePrecision] * 100.0), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (pow.f64 (+.f64 #s(literal 1 binary64) (/.f64 i n)) n) #s(literal 1 binary64)) (/.f64 i n)) < -0.0

   1. Initial program 28.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift-/.f64 N/A

         \[\leadsto 100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\color{blue}{\frac{i}{n}}} \]

      3. associate-/r/ N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i} \cdot n\right)} \]

      4. lower-*.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i} \cdot n\right)} \]

      5. lower-/.f64 27.7

         \[\leadsto 100 \cdot \left(\color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{i}} \cdot n\right) \]

      6. lift--.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{i} \cdot n\right) \]

      7. lift-pow.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n}} - 1}{i} \cdot n\right) \]

      8. pow-to-exp N/A

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

      9. lower-expm1.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{\color{blue}{\mathsf{expm1}\left(\log \left(1 + \frac{i}{n}\right) \cdot n\right)}}{i} \cdot n\right) \]

      10. lower-*.f64 N/A

          \[\leadsto 100 \cdot \left(\frac{\mathsf{expm1}\left(\color{blue}{\log \left(1 + \frac{i}{n}\right) \cdot n}\right)}{i} \cdot n\right) \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \left(\frac{\mathsf{expm1}\left(\log \color{blue}{\left(1 + \frac{i}{n}\right)} \cdot n\right)}{i} \cdot n\right) \]

      12. lower-log1p.f64 97.1

          \[\leadsto 100 \cdot \left(\frac{\mathsf{expm1}\left(\color{blue}{\mathsf{log1p}\left(\frac{i}{n}\right)} \cdot n\right)}{i} \cdot n\right) \]

   4. Applied rewrites 97.1%

      \[\leadsto 100 \cdot \color{blue}{\left(\frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)}{i} \cdot n\right)} \]

   if -0.0 < (/.f64 (-.f64 (pow.f64 (+.f64 #s(literal 1 binary64) (/.f64 i n)) n) #s(literal 1 binary64)) (/.f64 i n)) < +inf.0

   1. Initial program 98.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. associate-/r/ N/A

         \[\leadsto 100 \cdot \left(\color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{i} \cdot n} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. lower-fma.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      10. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{i}}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}}{i}, n, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      15. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-neg.f64 98.3

          \[\leadsto 100 \cdot \mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 98.3%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \frac{-n}{i}\right)} \]

   if +inf.0 < (/.f64 (-.f64 (pow.f64 (+.f64 #s(literal 1 binary64) (/.f64 i n)) n) #s(literal 1 binary64)) (/.f64 i n))

   1. Initial program 0.0%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 0.0

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 0.0%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto 100 \cdot \color{blue}{\frac{n + \left(-1 \cdot n + i \cdot n\right)}{i}} \]
   6. Step-by-step derivation

      1. associate-+r+ N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(n + -1 \cdot n\right) + i \cdot n}}{i} \]

      2. distribute-rgt1-in N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(-1 + 1\right) \cdot n} + i \cdot n}{i} \]

      3. metadata-eval N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{0} \cdot n + i \cdot n}{i} \]

      4. mul0-lft N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{0} + i \cdot n}{i} \]

      5. lower-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{0 + i \cdot n}{i}} \]

      6. mul0-lft N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{0 \cdot n} + i \cdot n}{i} \]

      7. metadata-eval N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(-1 + 1\right)} \cdot n + i \cdot n}{i} \]

      8. distribute-rgt1-in N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{\left(n + -1 \cdot n\right)} + i \cdot n}{i} \]

      9. associate-+r+ N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{n + \left(-1 \cdot n + i \cdot n\right)}}{i} \]

      10. +-commutative N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{\left(-1 \cdot n + i \cdot n\right) + n}}{i} \]

      11. +-commutative N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{\left(i \cdot n + -1 \cdot n\right)} + n}{i} \]

      12. associate-+r+ N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{i \cdot n + \left(-1 \cdot n + n\right)}}{i} \]

      13. *-commutative N/A

          \[\leadsto 100 \cdot \frac{\color{blue}{n \cdot i} + \left(-1 \cdot n + n\right)}{i} \]

      14. distribute-lft1-in N/A

          \[\leadsto 100 \cdot \frac{n \cdot i + \color{blue}{\left(-1 + 1\right) \cdot n}}{i} \]

      15. metadata-eval N/A

          \[\leadsto 100 \cdot \frac{n \cdot i + \color{blue}{0} \cdot n}{i} \]

      16. mul0-lft N/A

          \[\leadsto 100 \cdot \frac{n \cdot i + \color{blue}{0}}{i} \]

      17. lower-fma.f64 84.5

          \[\leadsto 100 \cdot \frac{\color{blue}{\mathsf{fma}\left(n, i, 0\right)}}{i} \]

   7. Applied rewrites 84.5%

      \[\leadsto 100 \cdot \color{blue}{\frac{\mathsf{fma}\left(n, i, 0\right)}{i}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 95.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{{\left(\frac{i}{n} + 1\right)}^{n} - 1}{\frac{i}{n}} \leq 0:\\ \;\;\;\;\left(\frac{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)}{i} \cdot n\right) \cdot 100\\ \mathbf{elif}\;\frac{{\left(\frac{i}{n} + 1\right)}^{n} - 1}{\frac{i}{n}} \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(\frac{{\left(\frac{i}{n} + 1\right)}^{n}}{i}, n, \frac{-n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(n, i, 0\right)}{i} \cdot 100\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{expm1}\left(i\right)}{i}\\ \mathbf{if}\;n \leq -4.8 \cdot 10^{-126}:\\ \;\;\;\;\left(t\_0 \cdot 100\right) \cdot n\\ \mathbf{elif}\;n \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(\left(\log \left(-i\right) - \log \left(-n\right)\right) \cdot n\right) \cdot 100\right) \cdot \frac{n}{i}\\ \mathbf{elif}\;n \leq 5.2 \cdot 10^{-166}:\\ \;\;\;\;\left(\left(\log i \cdot n - \log n \cdot n\right) \cdot \frac{n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;t\_0 \cdot \left(100 \cdot n\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (/ (expm1 i) i)))
   (if (<= n -4.8e-126)
     (* (* t_0 100.0) n)
     (if (<= n -1e-310)
       (* (* (* (- (log (- i)) (log (- n))) n) 100.0) (/ n i))
       (if (<= n 5.2e-166)
         (* (* (- (* (log i) n) (* (log n) n)) (/ n i)) 100.0)
         (* t_0 (* 100.0 n)))))))

C

double code(double i, double n) {
	double t_0 = expm1(i) / i;
	double tmp;
	if (n <= -4.8e-126) {
		tmp = (t_0 * 100.0) * n;
	} else if (n <= -1e-310) {
		tmp = (((log(-i) - log(-n)) * n) * 100.0) * (n / i);
	} else if (n <= 5.2e-166) {
		tmp = (((log(i) * n) - (log(n) * n)) * (n / i)) * 100.0;
	} else {
		tmp = t_0 * (100.0 * n);
	}
	return tmp;
}

Java

public static double code(double i, double n) {
	double t_0 = Math.expm1(i) / i;
	double tmp;
	if (n <= -4.8e-126) {
		tmp = (t_0 * 100.0) * n;
	} else if (n <= -1e-310) {
		tmp = (((Math.log(-i) - Math.log(-n)) * n) * 100.0) * (n / i);
	} else if (n <= 5.2e-166) {
		tmp = (((Math.log(i) * n) - (Math.log(n) * n)) * (n / i)) * 100.0;
	} else {
		tmp = t_0 * (100.0 * n);
	}
	return tmp;
}

Python

def code(i, n):
	t_0 = math.expm1(i) / i
	tmp = 0
	if n <= -4.8e-126:
		tmp = (t_0 * 100.0) * n
	elif n <= -1e-310:
		tmp = (((math.log(-i) - math.log(-n)) * n) * 100.0) * (n / i)
	elif n <= 5.2e-166:
		tmp = (((math.log(i) * n) - (math.log(n) * n)) * (n / i)) * 100.0
	else:
		tmp = t_0 * (100.0 * n)
	return tmp

Julia

function code(i, n)
	t_0 = Float64(expm1(i) / i)
	tmp = 0.0
	if (n <= -4.8e-126)
		tmp = Float64(Float64(t_0 * 100.0) * n);
	elseif (n <= -1e-310)
		tmp = Float64(Float64(Float64(Float64(log(Float64(-i)) - log(Float64(-n))) * n) * 100.0) * Float64(n / i));
	elseif (n <= 5.2e-166)
		tmp = Float64(Float64(Float64(Float64(log(i) * n) - Float64(log(n) * n)) * Float64(n / i)) * 100.0);
	else
		tmp = Float64(t_0 * Float64(100.0 * n));
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(N[(Exp[i] - 1), $MachinePrecision] / i), $MachinePrecision]}, If[LessEqual[n, -4.8e-126], N[(N[(t$95$0 * 100.0), $MachinePrecision] * n), $MachinePrecision], If[LessEqual[n, -1e-310], N[(N[(N[(N[(N[Log[(-i)], $MachinePrecision] - N[Log[(-n)], $MachinePrecision]), $MachinePrecision] * n), $MachinePrecision] * 100.0), $MachinePrecision] * N[(n / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 5.2e-166], N[(N[(N[(N[(N[Log[i], $MachinePrecision] * n), $MachinePrecision] - N[(N[Log[n], $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision] * N[(n / i), $MachinePrecision]), $MachinePrecision] * 100.0), $MachinePrecision], N[(t$95$0 * N[(100.0 * n), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if n < -4.80000000000000014e-126

   1. Initial program 36.9%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 88.0

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 88.0%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]

   if -4.80000000000000014e-126 < n < -9.999999999999969e-311

   1. Initial program 57.8%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      3. lower-*.f64 57.8

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \cdot 100 \]

      5. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\frac{i}{n}}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}} \cdot 100 \]

      6. associate-/r/ N/A

         \[\leadsto \color{blue}{\left(\frac{1}{\frac{i}{n}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      7. lift-/.f64 N/A

         \[\leadsto \left(\frac{1}{\color{blue}{\frac{i}{n}}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      8. clear-num N/A

         \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      10. lower-/.f64 54.6

          \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      11. lift--.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}\right) \cdot 100 \]

      12. lift-pow.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n}} - 1\right)\right) \cdot 100 \]

      13. pow-to-exp N/A

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

      14. lower-expm1.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\mathsf{expm1}\left(\log \left(1 + \frac{i}{n}\right) \cdot n\right)}\right) \cdot 100 \]

      15. lower-*.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\log \left(1 + \frac{i}{n}\right) \cdot n}\right)\right) \cdot 100 \]

      16. lift-+.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\log \color{blue}{\left(1 + \frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

      17. lower-log1p.f64 96.2

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\mathsf{log1p}\left(\frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

   4. Applied rewrites 96.2%

      \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)\right) \cdot 100} \]

   5. Taylor expanded in n around 0

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(n \cdot \left(\log i + -1 \cdot \log n\right)\right)}\right) \cdot 100 \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      3. mul-1-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i + \color{blue}{\left(\mathsf{neg}\left(\log n\right)\right)}\right) \cdot n\right)\right) \cdot 100 \]

      4. unsub-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      5. lower--.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      6. lower-log.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\color{blue}{\log i} - \log n\right) \cdot n\right)\right) \cdot 100 \]

      7. lower-log.f64 0.0

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i - \color{blue}{\log n}\right) \cdot n\right)\right) \cdot 100 \]

   7. Applied rewrites 0.0%

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i - \log n\right) \cdot n\right)}\right) \cdot 100 \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left(\left(\log i - \log n\right) \cdot n\right)\right) \cdot 100} \]

      2. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left(\left(\log i - \log n\right) \cdot n\right)\right)} \cdot 100 \]

      3. associate-*l* N/A

         \[\leadsto \color{blue}{\frac{n}{i} \cdot \left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot 100\right)} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{n}{i} \cdot \left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot 100\right)} \]

      5. lower-*.f64 0.0

         \[\leadsto \frac{n}{i} \cdot \color{blue}{\left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot 100\right)} \]

   9. Applied rewrites 52.8%

      \[\leadsto \color{blue}{\frac{n}{i} \cdot \left(\left(\log \left(\frac{i}{n}\right) \cdot n\right) \cdot 100\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 75.0%

       \[\leadsto \frac{n}{i} \cdot \left(\left(\left(\log \left(-i\right) - \log \left(-n\right)\right) \cdot n\right) \cdot 100\right) \]

   if -9.999999999999969e-311 < n < 5.19999999999999979e-166

   1. Initial program 44.0%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      3. lower-*.f64 44.0

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \cdot 100 \]

      5. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\frac{i}{n}}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}} \cdot 100 \]

      6. associate-/r/ N/A

         \[\leadsto \color{blue}{\left(\frac{1}{\frac{i}{n}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      7. lift-/.f64 N/A

         \[\leadsto \left(\frac{1}{\color{blue}{\frac{i}{n}}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      8. clear-num N/A

         \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      10. lower-/.f64 44.0

          \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      11. lift--.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}\right) \cdot 100 \]

      12. lift-pow.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n}} - 1\right)\right) \cdot 100 \]

      13. pow-to-exp N/A

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

      14. lower-expm1.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\mathsf{expm1}\left(\log \left(1 + \frac{i}{n}\right) \cdot n\right)}\right) \cdot 100 \]

      15. lower-*.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\log \left(1 + \frac{i}{n}\right) \cdot n}\right)\right) \cdot 100 \]

      16. lift-+.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\log \color{blue}{\left(1 + \frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

      17. lower-log1p.f64 66.3

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\mathsf{log1p}\left(\frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

   4. Applied rewrites 66.3%

      \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)\right) \cdot 100} \]

   5. Taylor expanded in n around 0

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(n \cdot \left(\log i + -1 \cdot \log n\right)\right)}\right) \cdot 100 \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      3. mul-1-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i + \color{blue}{\left(\mathsf{neg}\left(\log n\right)\right)}\right) \cdot n\right)\right) \cdot 100 \]

      4. unsub-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      5. lower--.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      6. lower-log.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\color{blue}{\log i} - \log n\right) \cdot n\right)\right) \cdot 100 \]

      7. lower-log.f64 96.4

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i - \color{blue}{\log n}\right) \cdot n\right)\right) \cdot 100 \]

   7. Applied rewrites 96.4%

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i - \log n\right) \cdot n\right)}\right) \cdot 100 \]
   8. Step-by-step derivation

   9. Applied rewrites 96.5%

      \[\leadsto \left(\frac{n}{i} \cdot \left(\log i \cdot n + \color{blue}{\left(-\log n\right) \cdot n}\right)\right) \cdot 100 \]

   if 5.19999999999999979e-166 < n

   1. Initial program 17.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 90.0

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]
   6. Step-by-step derivation

   7. Applied rewrites 90.1%

      \[\leadsto \frac{\mathsf{expm1}\left(i\right)}{i} \cdot \color{blue}{\left(100 \cdot n\right)} \]
3. Recombined 4 regimes into one program.

4. Final simplification 87.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq -4.8 \cdot 10^{-126}:\\ \;\;\;\;\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n\\ \mathbf{elif}\;n \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(\left(\log \left(-i\right) - \log \left(-n\right)\right) \cdot n\right) \cdot 100\right) \cdot \frac{n}{i}\\ \mathbf{elif}\;n \leq 5.2 \cdot 10^{-166}:\\ \;\;\;\;\left(\left(\log i \cdot n - \log n \cdot n\right) \cdot \frac{n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{expm1}\left(i\right)}{i} \cdot \left(100 \cdot n\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 81.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{expm1}\left(i\right)}{i}\\ \mathbf{if}\;n \leq -4.8 \cdot 10^{-126}:\\ \;\;\;\;\left(t\_0 \cdot 100\right) \cdot n\\ \mathbf{elif}\;n \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(\left(\log \left(-i\right) - \log \left(-n\right)\right) \cdot n\right) \cdot 100\right) \cdot \frac{n}{i}\\ \mathbf{elif}\;n \leq 5.2 \cdot 10^{-166}:\\ \;\;\;\;\left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot \frac{n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;t\_0 \cdot \left(100 \cdot n\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (/ (expm1 i) i)))
   (if (<= n -4.8e-126)
     (* (* t_0 100.0) n)
     (if (<= n -1e-310)
       (* (* (* (- (log (- i)) (log (- n))) n) 100.0) (/ n i))
       (if (<= n 5.2e-166)
         (* (* (* (- (log i) (log n)) n) (/ n i)) 100.0)
         (* t_0 (* 100.0 n)))))))

C

double code(double i, double n) {
	double t_0 = expm1(i) / i;
	double tmp;
	if (n <= -4.8e-126) {
		tmp = (t_0 * 100.0) * n;
	} else if (n <= -1e-310) {
		tmp = (((log(-i) - log(-n)) * n) * 100.0) * (n / i);
	} else if (n <= 5.2e-166) {
		tmp = (((log(i) - log(n)) * n) * (n / i)) * 100.0;
	} else {
		tmp = t_0 * (100.0 * n);
	}
	return tmp;
}

Java

public static double code(double i, double n) {
	double t_0 = Math.expm1(i) / i;
	double tmp;
	if (n <= -4.8e-126) {
		tmp = (t_0 * 100.0) * n;
	} else if (n <= -1e-310) {
		tmp = (((Math.log(-i) - Math.log(-n)) * n) * 100.0) * (n / i);
	} else if (n <= 5.2e-166) {
		tmp = (((Math.log(i) - Math.log(n)) * n) * (n / i)) * 100.0;
	} else {
		tmp = t_0 * (100.0 * n);
	}
	return tmp;
}

Python

def code(i, n):
	t_0 = math.expm1(i) / i
	tmp = 0
	if n <= -4.8e-126:
		tmp = (t_0 * 100.0) * n
	elif n <= -1e-310:
		tmp = (((math.log(-i) - math.log(-n)) * n) * 100.0) * (n / i)
	elif n <= 5.2e-166:
		tmp = (((math.log(i) - math.log(n)) * n) * (n / i)) * 100.0
	else:
		tmp = t_0 * (100.0 * n)
	return tmp

Julia

function code(i, n)
	t_0 = Float64(expm1(i) / i)
	tmp = 0.0
	if (n <= -4.8e-126)
		tmp = Float64(Float64(t_0 * 100.0) * n);
	elseif (n <= -1e-310)
		tmp = Float64(Float64(Float64(Float64(log(Float64(-i)) - log(Float64(-n))) * n) * 100.0) * Float64(n / i));
	elseif (n <= 5.2e-166)
		tmp = Float64(Float64(Float64(Float64(log(i) - log(n)) * n) * Float64(n / i)) * 100.0);
	else
		tmp = Float64(t_0 * Float64(100.0 * n));
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(N[(Exp[i] - 1), $MachinePrecision] / i), $MachinePrecision]}, If[LessEqual[n, -4.8e-126], N[(N[(t$95$0 * 100.0), $MachinePrecision] * n), $MachinePrecision], If[LessEqual[n, -1e-310], N[(N[(N[(N[(N[Log[(-i)], $MachinePrecision] - N[Log[(-n)], $MachinePrecision]), $MachinePrecision] * n), $MachinePrecision] * 100.0), $MachinePrecision] * N[(n / i), $MachinePrecision]), $MachinePrecision], If[LessEqual[n, 5.2e-166], N[(N[(N[(N[(N[Log[i], $MachinePrecision] - N[Log[n], $MachinePrecision]), $MachinePrecision] * n), $MachinePrecision] * N[(n / i), $MachinePrecision]), $MachinePrecision] * 100.0), $MachinePrecision], N[(t$95$0 * N[(100.0 * n), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if n < -4.80000000000000014e-126

   1. Initial program 36.9%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 88.0

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 88.0%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]

   if -4.80000000000000014e-126 < n < -9.999999999999969e-311

   1. Initial program 57.8%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      3. lower-*.f64 57.8

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \cdot 100 \]

      5. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\frac{i}{n}}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}} \cdot 100 \]

      6. associate-/r/ N/A

         \[\leadsto \color{blue}{\left(\frac{1}{\frac{i}{n}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      7. lift-/.f64 N/A

         \[\leadsto \left(\frac{1}{\color{blue}{\frac{i}{n}}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      8. clear-num N/A

         \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      10. lower-/.f64 54.6

          \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      11. lift--.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}\right) \cdot 100 \]

      12. lift-pow.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n}} - 1\right)\right) \cdot 100 \]

      13. pow-to-exp N/A

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

      14. lower-expm1.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\mathsf{expm1}\left(\log \left(1 + \frac{i}{n}\right) \cdot n\right)}\right) \cdot 100 \]

      15. lower-*.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\log \left(1 + \frac{i}{n}\right) \cdot n}\right)\right) \cdot 100 \]

      16. lift-+.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\log \color{blue}{\left(1 + \frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

      17. lower-log1p.f64 96.2

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\mathsf{log1p}\left(\frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

   4. Applied rewrites 96.2%

      \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)\right) \cdot 100} \]

   5. Taylor expanded in n around 0

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(n \cdot \left(\log i + -1 \cdot \log n\right)\right)}\right) \cdot 100 \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      3. mul-1-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i + \color{blue}{\left(\mathsf{neg}\left(\log n\right)\right)}\right) \cdot n\right)\right) \cdot 100 \]

      4. unsub-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      5. lower--.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      6. lower-log.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\color{blue}{\log i} - \log n\right) \cdot n\right)\right) \cdot 100 \]

      7. lower-log.f64 0.0

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i - \color{blue}{\log n}\right) \cdot n\right)\right) \cdot 100 \]

   7. Applied rewrites 0.0%

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i - \log n\right) \cdot n\right)}\right) \cdot 100 \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left(\left(\log i - \log n\right) \cdot n\right)\right) \cdot 100} \]

      2. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left(\left(\log i - \log n\right) \cdot n\right)\right)} \cdot 100 \]

      3. associate-*l* N/A

         \[\leadsto \color{blue}{\frac{n}{i} \cdot \left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot 100\right)} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{n}{i} \cdot \left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot 100\right)} \]

      5. lower-*.f64 0.0

         \[\leadsto \frac{n}{i} \cdot \color{blue}{\left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot 100\right)} \]

   9. Applied rewrites 52.8%

      \[\leadsto \color{blue}{\frac{n}{i} \cdot \left(\left(\log \left(\frac{i}{n}\right) \cdot n\right) \cdot 100\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 75.0%

       \[\leadsto \frac{n}{i} \cdot \left(\left(\left(\log \left(-i\right) - \log \left(-n\right)\right) \cdot n\right) \cdot 100\right) \]

   if -9.999999999999969e-311 < n < 5.19999999999999979e-166

   1. Initial program 44.0%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      3. lower-*.f64 44.0

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \cdot 100 \]

      5. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\frac{i}{n}}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}} \cdot 100 \]

      6. associate-/r/ N/A

         \[\leadsto \color{blue}{\left(\frac{1}{\frac{i}{n}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      7. lift-/.f64 N/A

         \[\leadsto \left(\frac{1}{\color{blue}{\frac{i}{n}}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      8. clear-num N/A

         \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      10. lower-/.f64 44.0

          \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      11. lift--.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}\right) \cdot 100 \]

      12. lift-pow.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n}} - 1\right)\right) \cdot 100 \]

      13. pow-to-exp N/A

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

      14. lower-expm1.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\mathsf{expm1}\left(\log \left(1 + \frac{i}{n}\right) \cdot n\right)}\right) \cdot 100 \]

      15. lower-*.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\log \left(1 + \frac{i}{n}\right) \cdot n}\right)\right) \cdot 100 \]

      16. lift-+.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\log \color{blue}{\left(1 + \frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

      17. lower-log1p.f64 66.3

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\mathsf{log1p}\left(\frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

   4. Applied rewrites 66.3%

      \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)\right) \cdot 100} \]

   5. Taylor expanded in n around 0

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(n \cdot \left(\log i + -1 \cdot \log n\right)\right)}\right) \cdot 100 \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      3. mul-1-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i + \color{blue}{\left(\mathsf{neg}\left(\log n\right)\right)}\right) \cdot n\right)\right) \cdot 100 \]

      4. unsub-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      5. lower--.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      6. lower-log.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\color{blue}{\log i} - \log n\right) \cdot n\right)\right) \cdot 100 \]

      7. lower-log.f64 96.4

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i - \color{blue}{\log n}\right) \cdot n\right)\right) \cdot 100 \]

   7. Applied rewrites 96.4%

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i - \log n\right) \cdot n\right)}\right) \cdot 100 \]

   if 5.19999999999999979e-166 < n

   1. Initial program 17.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 90.0

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]
   6. Step-by-step derivation

   7. Applied rewrites 90.1%

      \[\leadsto \frac{\mathsf{expm1}\left(i\right)}{i} \cdot \color{blue}{\left(100 \cdot n\right)} \]
3. Recombined 4 regimes into one program.

4. Final simplification 87.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq -4.8 \cdot 10^{-126}:\\ \;\;\;\;\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n\\ \mathbf{elif}\;n \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(\left(\log \left(-i\right) - \log \left(-n\right)\right) \cdot n\right) \cdot 100\right) \cdot \frac{n}{i}\\ \mathbf{elif}\;n \leq 5.2 \cdot 10^{-166}:\\ \;\;\;\;\left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot \frac{n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{expm1}\left(i\right)}{i} \cdot \left(100 \cdot n\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 81.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{expm1}\left(i\right)}{i}\\ \mathbf{if}\;n \leq -4.8 \cdot 10^{-126}:\\ \;\;\;\;\left(t\_0 \cdot 100\right) \cdot n\\ \mathbf{elif}\;n \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(\left(\log \left(-i\right) - \log \left(-n\right)\right) \cdot n\right) \cdot \frac{n}{i}\right) \cdot 100\\ \mathbf{elif}\;n \leq 5.2 \cdot 10^{-166}:\\ \;\;\;\;\left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot \frac{n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;t\_0 \cdot \left(100 \cdot n\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (/ (expm1 i) i)))
   (if (<= n -4.8e-126)
     (* (* t_0 100.0) n)
     (if (<= n -1e-310)
       (* (* (* (- (log (- i)) (log (- n))) n) (/ n i)) 100.0)
       (if (<= n 5.2e-166)
         (* (* (* (- (log i) (log n)) n) (/ n i)) 100.0)
         (* t_0 (* 100.0 n)))))))

C

double code(double i, double n) {
	double t_0 = expm1(i) / i;
	double tmp;
	if (n <= -4.8e-126) {
		tmp = (t_0 * 100.0) * n;
	} else if (n <= -1e-310) {
		tmp = (((log(-i) - log(-n)) * n) * (n / i)) * 100.0;
	} else if (n <= 5.2e-166) {
		tmp = (((log(i) - log(n)) * n) * (n / i)) * 100.0;
	} else {
		tmp = t_0 * (100.0 * n);
	}
	return tmp;
}

Java

public static double code(double i, double n) {
	double t_0 = Math.expm1(i) / i;
	double tmp;
	if (n <= -4.8e-126) {
		tmp = (t_0 * 100.0) * n;
	} else if (n <= -1e-310) {
		tmp = (((Math.log(-i) - Math.log(-n)) * n) * (n / i)) * 100.0;
	} else if (n <= 5.2e-166) {
		tmp = (((Math.log(i) - Math.log(n)) * n) * (n / i)) * 100.0;
	} else {
		tmp = t_0 * (100.0 * n);
	}
	return tmp;
}

Python

def code(i, n):
	t_0 = math.expm1(i) / i
	tmp = 0
	if n <= -4.8e-126:
		tmp = (t_0 * 100.0) * n
	elif n <= -1e-310:
		tmp = (((math.log(-i) - math.log(-n)) * n) * (n / i)) * 100.0
	elif n <= 5.2e-166:
		tmp = (((math.log(i) - math.log(n)) * n) * (n / i)) * 100.0
	else:
		tmp = t_0 * (100.0 * n)
	return tmp

Julia

function code(i, n)
	t_0 = Float64(expm1(i) / i)
	tmp = 0.0
	if (n <= -4.8e-126)
		tmp = Float64(Float64(t_0 * 100.0) * n);
	elseif (n <= -1e-310)
		tmp = Float64(Float64(Float64(Float64(log(Float64(-i)) - log(Float64(-n))) * n) * Float64(n / i)) * 100.0);
	elseif (n <= 5.2e-166)
		tmp = Float64(Float64(Float64(Float64(log(i) - log(n)) * n) * Float64(n / i)) * 100.0);
	else
		tmp = Float64(t_0 * Float64(100.0 * n));
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(N[(Exp[i] - 1), $MachinePrecision] / i), $MachinePrecision]}, If[LessEqual[n, -4.8e-126], N[(N[(t$95$0 * 100.0), $MachinePrecision] * n), $MachinePrecision], If[LessEqual[n, -1e-310], N[(N[(N[(N[(N[Log[(-i)], $MachinePrecision] - N[Log[(-n)], $MachinePrecision]), $MachinePrecision] * n), $MachinePrecision] * N[(n / i), $MachinePrecision]), $MachinePrecision] * 100.0), $MachinePrecision], If[LessEqual[n, 5.2e-166], N[(N[(N[(N[(N[Log[i], $MachinePrecision] - N[Log[n], $MachinePrecision]), $MachinePrecision] * n), $MachinePrecision] * N[(n / i), $MachinePrecision]), $MachinePrecision] * 100.0), $MachinePrecision], N[(t$95$0 * N[(100.0 * n), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if n < -4.80000000000000014e-126

   1. Initial program 36.9%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 88.0

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 88.0%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]

   if -4.80000000000000014e-126 < n < -9.999999999999969e-311

   1. Initial program 57.8%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      3. lower-*.f64 57.8

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \cdot 100 \]

      5. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\frac{i}{n}}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}} \cdot 100 \]

      6. associate-/r/ N/A

         \[\leadsto \color{blue}{\left(\frac{1}{\frac{i}{n}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      7. lift-/.f64 N/A

         \[\leadsto \left(\frac{1}{\color{blue}{\frac{i}{n}}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      8. clear-num N/A

         \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      10. lower-/.f64 54.6

          \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      11. lift--.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}\right) \cdot 100 \]

      12. lift-pow.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n}} - 1\right)\right) \cdot 100 \]

      13. pow-to-exp N/A

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

      14. lower-expm1.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\mathsf{expm1}\left(\log \left(1 + \frac{i}{n}\right) \cdot n\right)}\right) \cdot 100 \]

      15. lower-*.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\log \left(1 + \frac{i}{n}\right) \cdot n}\right)\right) \cdot 100 \]

      16. lift-+.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\log \color{blue}{\left(1 + \frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

      17. lower-log1p.f64 96.2

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\mathsf{log1p}\left(\frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

   4. Applied rewrites 96.2%

      \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)\right) \cdot 100} \]

   5. Taylor expanded in n around 0

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(n \cdot \left(\log i + -1 \cdot \log n\right)\right)}\right) \cdot 100 \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      3. mul-1-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i + \color{blue}{\left(\mathsf{neg}\left(\log n\right)\right)}\right) \cdot n\right)\right) \cdot 100 \]

      4. unsub-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      5. lower--.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      6. lower-log.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\color{blue}{\log i} - \log n\right) \cdot n\right)\right) \cdot 100 \]

      7. lower-log.f64 0.0

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i - \color{blue}{\log n}\right) \cdot n\right)\right) \cdot 100 \]

   7. Applied rewrites 0.0%

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i - \log n\right) \cdot n\right)}\right) \cdot 100 \]
   8. Step-by-step derivation

   9. Applied rewrites 74.9%

      \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log \left(-i\right) - \log \left(-n\right)\right) \cdot n\right)\right) \cdot 100 \]

   if -9.999999999999969e-311 < n < 5.19999999999999979e-166

   1. Initial program 44.0%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      3. lower-*.f64 44.0

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \cdot 100} \]

      4. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \cdot 100 \]

      5. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{\frac{i}{n}}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}} \cdot 100 \]

      6. associate-/r/ N/A

         \[\leadsto \color{blue}{\left(\frac{1}{\frac{i}{n}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      7. lift-/.f64 N/A

         \[\leadsto \left(\frac{1}{\color{blue}{\frac{i}{n}}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      8. clear-num N/A

         \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right)} \cdot 100 \]

      10. lower-/.f64 44.0

          \[\leadsto \left(\color{blue}{\frac{n}{i}} \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)\right) \cdot 100 \]

      11. lift--.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left({\left(1 + \frac{i}{n}\right)}^{n} - 1\right)}\right) \cdot 100 \]

      12. lift-pow.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n}} - 1\right)\right) \cdot 100 \]

      13. pow-to-exp N/A

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

      14. lower-expm1.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\mathsf{expm1}\left(\log \left(1 + \frac{i}{n}\right) \cdot n\right)}\right) \cdot 100 \]

      15. lower-*.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\log \left(1 + \frac{i}{n}\right) \cdot n}\right)\right) \cdot 100 \]

      16. lift-+.f64 N/A

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\log \color{blue}{\left(1 + \frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

      17. lower-log1p.f64 66.3

          \[\leadsto \left(\frac{n}{i} \cdot \mathsf{expm1}\left(\color{blue}{\mathsf{log1p}\left(\frac{i}{n}\right)} \cdot n\right)\right) \cdot 100 \]

   4. Applied rewrites 66.3%

      \[\leadsto \color{blue}{\left(\frac{n}{i} \cdot \mathsf{expm1}\left(\mathsf{log1p}\left(\frac{i}{n}\right) \cdot n\right)\right) \cdot 100} \]

   5. Taylor expanded in n around 0

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(n \cdot \left(\log i + -1 \cdot \log n\right)\right)}\right) \cdot 100 \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i + -1 \cdot \log n\right) \cdot n\right)}\right) \cdot 100 \]

      3. mul-1-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i + \color{blue}{\left(\mathsf{neg}\left(\log n\right)\right)}\right) \cdot n\right)\right) \cdot 100 \]

      4. unsub-neg N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      5. lower--.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\color{blue}{\left(\log i - \log n\right)} \cdot n\right)\right) \cdot 100 \]

      6. lower-log.f64 N/A

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\color{blue}{\log i} - \log n\right) \cdot n\right)\right) \cdot 100 \]

      7. lower-log.f64 96.4

         \[\leadsto \left(\frac{n}{i} \cdot \left(\left(\log i - \color{blue}{\log n}\right) \cdot n\right)\right) \cdot 100 \]

   7. Applied rewrites 96.4%

      \[\leadsto \left(\frac{n}{i} \cdot \color{blue}{\left(\left(\log i - \log n\right) \cdot n\right)}\right) \cdot 100 \]

   if 5.19999999999999979e-166 < n

   1. Initial program 17.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 90.0

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]
   6. Step-by-step derivation

   7. Applied rewrites 90.1%

      \[\leadsto \frac{\mathsf{expm1}\left(i\right)}{i} \cdot \color{blue}{\left(100 \cdot n\right)} \]
3. Recombined 4 regimes into one program.

4. Final simplification 87.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq -4.8 \cdot 10^{-126}:\\ \;\;\;\;\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n\\ \mathbf{elif}\;n \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(\left(\log \left(-i\right) - \log \left(-n\right)\right) \cdot n\right) \cdot \frac{n}{i}\right) \cdot 100\\ \mathbf{elif}\;n \leq 5.2 \cdot 10^{-166}:\\ \;\;\;\;\left(\left(\left(\log i - \log n\right) \cdot n\right) \cdot \frac{n}{i}\right) \cdot 100\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{expm1}\left(i\right)}{i} \cdot \left(100 \cdot n\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 80.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\mathsf{expm1}\left(i\right)}{i}\\ \mathbf{if}\;n \leq -7.2 \cdot 10^{-218}:\\ \;\;\;\;\left(t\_0 \cdot 100\right) \cdot n\\ \mathbf{elif}\;n \leq 3.5 \cdot 10^{-167}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;t\_0 \cdot \left(100 \cdot n\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (/ (expm1 i) i)))
   (if (<= n -7.2e-218)
     (* (* t_0 100.0) n)
     (if (<= n 3.5e-167) 0.0 (* t_0 (* 100.0 n))))))

C

double code(double i, double n) {
	double t_0 = expm1(i) / i;
	double tmp;
	if (n <= -7.2e-218) {
		tmp = (t_0 * 100.0) * n;
	} else if (n <= 3.5e-167) {
		tmp = 0.0;
	} else {
		tmp = t_0 * (100.0 * n);
	}
	return tmp;
}

Java

public static double code(double i, double n) {
	double t_0 = Math.expm1(i) / i;
	double tmp;
	if (n <= -7.2e-218) {
		tmp = (t_0 * 100.0) * n;
	} else if (n <= 3.5e-167) {
		tmp = 0.0;
	} else {
		tmp = t_0 * (100.0 * n);
	}
	return tmp;
}

Python

def code(i, n):
	t_0 = math.expm1(i) / i
	tmp = 0
	if n <= -7.2e-218:
		tmp = (t_0 * 100.0) * n
	elif n <= 3.5e-167:
		tmp = 0.0
	else:
		tmp = t_0 * (100.0 * n)
	return tmp

Julia

function code(i, n)
	t_0 = Float64(expm1(i) / i)
	tmp = 0.0
	if (n <= -7.2e-218)
		tmp = Float64(Float64(t_0 * 100.0) * n);
	elseif (n <= 3.5e-167)
		tmp = 0.0;
	else
		tmp = Float64(t_0 * Float64(100.0 * n));
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(N[(Exp[i] - 1), $MachinePrecision] / i), $MachinePrecision]}, If[LessEqual[n, -7.2e-218], N[(N[(t$95$0 * 100.0), $MachinePrecision] * n), $MachinePrecision], If[LessEqual[n, 3.5e-167], 0.0, N[(t$95$0 * N[(100.0 * n), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if n < -7.20000000000000023e-218

   1. Initial program 37.5%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 83.8

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 83.8%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]

   if -7.20000000000000023e-218 < n < 3.4999999999999999e-167

   1. Initial program 59.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 55.9

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 55.9%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto \color{blue}{100 \cdot \frac{n + -1 \cdot n}{i}} \]
   6. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left(n + -1 \cdot n\right)}{i}} \]

      2. distribute-rgt1-in N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot n\right)}}{i} \]

      3. metadata-eval N/A

         \[\leadsto \frac{100 \cdot \left(\color{blue}{0} \cdot n\right)}{i} \]

      4. mul0-lft N/A

         \[\leadsto \frac{100 \cdot \color{blue}{0}}{i} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{0}}{i} \]

      6. lower-/.f64 74.6

         \[\leadsto \color{blue}{\frac{0}{i}} \]

   7. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\frac{0}{i}} \]
   8. Step-by-step derivation

   9. Applied rewrites 74.6%

      \[\leadsto \color{blue}{0} \]

   if 3.4999999999999999e-167 < n

   1. Initial program 17.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 90.0

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]
   6. Step-by-step derivation

   7. Applied rewrites 90.1%

      \[\leadsto \frac{\mathsf{expm1}\left(i\right)}{i} \cdot \color{blue}{\left(100 \cdot n\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 80.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n\\ \mathbf{if}\;n \leq -7.2 \cdot 10^{-218}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n \leq 3.5 \cdot 10^{-167}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (* (* (/ (expm1 i) i) 100.0) n)))
   (if (<= n -7.2e-218) t_0 (if (<= n 3.5e-167) 0.0 t_0))))

C

double code(double i, double n) {
	double t_0 = ((expm1(i) / i) * 100.0) * n;
	double tmp;
	if (n <= -7.2e-218) {
		tmp = t_0;
	} else if (n <= 3.5e-167) {
		tmp = 0.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double i, double n) {
	double t_0 = ((Math.expm1(i) / i) * 100.0) * n;
	double tmp;
	if (n <= -7.2e-218) {
		tmp = t_0;
	} else if (n <= 3.5e-167) {
		tmp = 0.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(i, n):
	t_0 = ((math.expm1(i) / i) * 100.0) * n
	tmp = 0
	if n <= -7.2e-218:
		tmp = t_0
	elif n <= 3.5e-167:
		tmp = 0.0
	else:
		tmp = t_0
	return tmp

Julia

function code(i, n)
	t_0 = Float64(Float64(Float64(expm1(i) / i) * 100.0) * n)
	tmp = 0.0
	if (n <= -7.2e-218)
		tmp = t_0;
	elseif (n <= 3.5e-167)
		tmp = 0.0;
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(N[(N[(N[(Exp[i] - 1), $MachinePrecision] / i), $MachinePrecision] * 100.0), $MachinePrecision] * n), $MachinePrecision]}, If[LessEqual[n, -7.2e-218], t$95$0, If[LessEqual[n, 3.5e-167], 0.0, t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if n < -7.20000000000000023e-218 or 3.4999999999999999e-167 < n

   1. Initial program 27.7%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 86.8

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 86.8%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]

   if -7.20000000000000023e-218 < n < 3.4999999999999999e-167

   1. Initial program 59.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 55.9

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 55.9%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto \color{blue}{100 \cdot \frac{n + -1 \cdot n}{i}} \]
   6. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left(n + -1 \cdot n\right)}{i}} \]

      2. distribute-rgt1-in N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot n\right)}}{i} \]

      3. metadata-eval N/A

         \[\leadsto \frac{100 \cdot \left(\color{blue}{0} \cdot n\right)}{i} \]

      4. mul0-lft N/A

         \[\leadsto \frac{100 \cdot \color{blue}{0}}{i} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{0}}{i} \]

      6. lower-/.f64 74.6

         \[\leadsto \color{blue}{\frac{0}{i}} \]

   7. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\frac{0}{i}} \]
   8. Step-by-step derivation

   9. Applied rewrites 74.6%

      \[\leadsto \color{blue}{0} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 80.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\frac{100}{i} \cdot \mathsf{expm1}\left(i\right)\right) \cdot n\\ \mathbf{if}\;n \leq -7.2 \cdot 10^{-218}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n \leq 3.5 \cdot 10^{-167}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (* (* (/ 100.0 i) (expm1 i)) n)))
   (if (<= n -7.2e-218) t_0 (if (<= n 3.5e-167) 0.0 t_0))))

C

double code(double i, double n) {
	double t_0 = ((100.0 / i) * expm1(i)) * n;
	double tmp;
	if (n <= -7.2e-218) {
		tmp = t_0;
	} else if (n <= 3.5e-167) {
		tmp = 0.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double i, double n) {
	double t_0 = ((100.0 / i) * Math.expm1(i)) * n;
	double tmp;
	if (n <= -7.2e-218) {
		tmp = t_0;
	} else if (n <= 3.5e-167) {
		tmp = 0.0;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(i, n):
	t_0 = ((100.0 / i) * math.expm1(i)) * n
	tmp = 0
	if n <= -7.2e-218:
		tmp = t_0
	elif n <= 3.5e-167:
		tmp = 0.0
	else:
		tmp = t_0
	return tmp

Julia

function code(i, n)
	t_0 = Float64(Float64(Float64(100.0 / i) * expm1(i)) * n)
	tmp = 0.0
	if (n <= -7.2e-218)
		tmp = t_0;
	elseif (n <= 3.5e-167)
		tmp = 0.0;
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(N[(N[(100.0 / i), $MachinePrecision] * N[(Exp[i] - 1), $MachinePrecision]), $MachinePrecision] * n), $MachinePrecision]}, If[LessEqual[n, -7.2e-218], t$95$0, If[LessEqual[n, 3.5e-167], 0.0, t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if n < -7.20000000000000023e-218 or 3.4999999999999999e-167 < n

   1. Initial program 27.7%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 86.8

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 86.8%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]
   6. Step-by-step derivation

   7. Applied rewrites 86.3%

      \[\leadsto \left(\mathsf{expm1}\left(i\right) \cdot \frac{100}{i}\right) \cdot n \]

   if -7.20000000000000023e-218 < n < 3.4999999999999999e-167

   1. Initial program 59.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 55.9

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 55.9%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto \color{blue}{100 \cdot \frac{n + -1 \cdot n}{i}} \]
   6. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left(n + -1 \cdot n\right)}{i}} \]

      2. distribute-rgt1-in N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot n\right)}}{i} \]

      3. metadata-eval N/A

         \[\leadsto \frac{100 \cdot \left(\color{blue}{0} \cdot n\right)}{i} \]

      4. mul0-lft N/A

         \[\leadsto \frac{100 \cdot \color{blue}{0}}{i} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{0}}{i} \]

      6. lower-/.f64 74.6

         \[\leadsto \color{blue}{\frac{0}{i}} \]

   7. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\frac{0}{i}} \]
   8. Step-by-step derivation

   9. Applied rewrites 74.6%

      \[\leadsto \color{blue}{0} \]
3. Recombined 2 regimes into one program.

4. Final simplification 85.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;n \leq -7.2 \cdot 10^{-218}:\\ \;\;\;\;\left(\frac{100}{i} \cdot \mathsf{expm1}\left(i\right)\right) \cdot n\\ \mathbf{elif}\;n \leq 3.5 \cdot 10^{-167}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\left(\frac{100}{i} \cdot \mathsf{expm1}\left(i\right)\right) \cdot n\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 66.1% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;n \leq -4 \cdot 10^{-126}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(16.666666666666668, i, 50\right), i, 100\right) \cdot n\\ \mathbf{elif}\;n \leq 3.5 \cdot 10^{-167}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(4.166666666666667, i, 16.666666666666668\right), i, 50\right), i, 100\right) \cdot n\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (if (<= n -4e-126)
   (* (fma (fma 16.666666666666668 i 50.0) i 100.0) n)
   (if (<= n 3.5e-167)
     0.0
     (*
      (fma (fma (fma 4.166666666666667 i 16.666666666666668) i 50.0) i 100.0)
      n))))

C

double code(double i, double n) {
	double tmp;
	if (n <= -4e-126) {
		tmp = fma(fma(16.666666666666668, i, 50.0), i, 100.0) * n;
	} else if (n <= 3.5e-167) {
		tmp = 0.0;
	} else {
		tmp = fma(fma(fma(4.166666666666667, i, 16.666666666666668), i, 50.0), i, 100.0) * n;
	}
	return tmp;
}

Julia

function code(i, n)
	tmp = 0.0
	if (n <= -4e-126)
		tmp = Float64(fma(fma(16.666666666666668, i, 50.0), i, 100.0) * n);
	elseif (n <= 3.5e-167)
		tmp = 0.0;
	else
		tmp = Float64(fma(fma(fma(4.166666666666667, i, 16.666666666666668), i, 50.0), i, 100.0) * n);
	end
	return tmp
end

Wolfram

code[i_, n_] := If[LessEqual[n, -4e-126], N[(N[(N[(16.666666666666668 * i + 50.0), $MachinePrecision] * i + 100.0), $MachinePrecision] * n), $MachinePrecision], If[LessEqual[n, 3.5e-167], 0.0, N[(N[(N[(N[(4.166666666666667 * i + 16.666666666666668), $MachinePrecision] * i + 50.0), $MachinePrecision] * i + 100.0), $MachinePrecision] * n), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if n < -3.9999999999999998e-126

   1. Initial program 36.9%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 88.0

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 88.0%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]

   6. Taylor expanded in i around 0

      \[\leadsto \left(100 + i \cdot \left(50 + \frac{50}{3} \cdot i\right)\right) \cdot n \]
   7. Step-by-step derivation

   8. Applied rewrites 52.7%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(16.666666666666668, i, 50\right), i, 100\right) \cdot n \]

   if -3.9999999999999998e-126 < n < 3.4999999999999999e-167

   1. Initial program 53.5%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 51.3

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 51.3%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto \color{blue}{100 \cdot \frac{n + -1 \cdot n}{i}} \]
   6. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left(n + -1 \cdot n\right)}{i}} \]

      2. distribute-rgt1-in N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot n\right)}}{i} \]

      3. metadata-eval N/A

         \[\leadsto \frac{100 \cdot \left(\color{blue}{0} \cdot n\right)}{i} \]

      4. mul0-lft N/A

         \[\leadsto \frac{100 \cdot \color{blue}{0}}{i} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{0}}{i} \]

      6. lower-/.f64 63.8

         \[\leadsto \color{blue}{\frac{0}{i}} \]

   7. Applied rewrites 63.8%

      \[\leadsto \color{blue}{\frac{0}{i}} \]
   8. Step-by-step derivation

   9. Applied rewrites 63.8%

      \[\leadsto \color{blue}{0} \]

   if 3.4999999999999999e-167 < n

   1. Initial program 17.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 90.0

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]

   6. Taylor expanded in i around 0

      \[\leadsto \left(100 + i \cdot \left(50 + i \cdot \left(\frac{50}{3} + \frac{25}{6} \cdot i\right)\right)\right) \cdot n \]
   7. Step-by-step derivation

   8. Applied rewrites 76.7%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(4.166666666666667, i, 16.666666666666668\right), i, 50\right), i, 100\right) \cdot n \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 11: 62.6% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq -2000000000000:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, i, 0.5\right), i, 1\right) \cdot n\right) \cdot 100\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (if (<= i -2000000000000.0)
   0.0
   (* (* (fma (fma 0.16666666666666666 i 0.5) i 1.0) n) 100.0)))

C

double code(double i, double n) {
	double tmp;
	if (i <= -2000000000000.0) {
		tmp = 0.0;
	} else {
		tmp = (fma(fma(0.16666666666666666, i, 0.5), i, 1.0) * n) * 100.0;
	}
	return tmp;
}

Julia

function code(i, n)
	tmp = 0.0
	if (i <= -2000000000000.0)
		tmp = 0.0;
	else
		tmp = Float64(Float64(fma(fma(0.16666666666666666, i, 0.5), i, 1.0) * n) * 100.0);
	end
	return tmp
end

Wolfram

code[i_, n_] := If[LessEqual[i, -2000000000000.0], 0.0, N[(N[(N[(N[(0.16666666666666666 * i + 0.5), $MachinePrecision] * i + 1.0), $MachinePrecision] * n), $MachinePrecision] * 100.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if i < -2e12

   1. Initial program 62.9%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 61.6

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 61.6%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto \color{blue}{100 \cdot \frac{n + -1 \cdot n}{i}} \]
   6. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left(n + -1 \cdot n\right)}{i}} \]

      2. distribute-rgt1-in N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot n\right)}}{i} \]

      3. metadata-eval N/A

         \[\leadsto \frac{100 \cdot \left(\color{blue}{0} \cdot n\right)}{i} \]

      4. mul0-lft N/A

         \[\leadsto \frac{100 \cdot \color{blue}{0}}{i} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{0}}{i} \]

      6. lower-/.f64 26.3

         \[\leadsto \color{blue}{\frac{0}{i}} \]

   7. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\frac{0}{i}} \]
   8. Step-by-step derivation

   9. Applied rewrites 26.3%

      \[\leadsto \color{blue}{0} \]

   if -2e12 < i

   1. Initial program 20.4%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in i around 0

      \[\leadsto 100 \cdot \color{blue}{\left(n + i \cdot \left(i \cdot \left(n \cdot \left(\left(\frac{1}{6} + \frac{1}{3} \cdot \frac{1}{{n}^{2}}\right) - \frac{1}{2} \cdot \frac{1}{n}\right)\right) + n \cdot \left(\frac{1}{2} - \frac{1}{2} \cdot \frac{1}{n}\right)\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto 100 \cdot \color{blue}{\left(i \cdot \left(i \cdot \left(n \cdot \left(\left(\frac{1}{6} + \frac{1}{3} \cdot \frac{1}{{n}^{2}}\right) - \frac{1}{2} \cdot \frac{1}{n}\right)\right) + n \cdot \left(\frac{1}{2} - \frac{1}{2} \cdot \frac{1}{n}\right)\right) + n\right)} \]

   5. Applied rewrites 69.9%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left(n \cdot i, \mathsf{fma}\left(\left(\frac{0.3333333333333333}{n \cdot n} + 0.16666666666666666\right) - \frac{0.5}{n}, i, 0.5 - \frac{0.5}{n}\right), n\right)} \]

   6. Taylor expanded in n around inf

      \[\leadsto 100 \cdot \left(n \cdot \color{blue}{\left(1 + i \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot i\right)\right)}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 73.6%

      \[\leadsto 100 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, i, 0.5\right), i, 1\right) \cdot \color{blue}{n}\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 62.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;i \leq -2000000000000:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, i, 0.5\right), i, 1\right) \cdot n\right) \cdot 100\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 62.6% accurate, 6.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq -2000000000000:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(16.666666666666668, i, 50\right), i, 100\right) \cdot n\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (if (<= i -2000000000000.0)
   0.0
   (* (fma (fma 16.666666666666668 i 50.0) i 100.0) n)))

C

double code(double i, double n) {
	double tmp;
	if (i <= -2000000000000.0) {
		tmp = 0.0;
	} else {
		tmp = fma(fma(16.666666666666668, i, 50.0), i, 100.0) * n;
	}
	return tmp;
}

Julia

function code(i, n)
	tmp = 0.0
	if (i <= -2000000000000.0)
		tmp = 0.0;
	else
		tmp = Float64(fma(fma(16.666666666666668, i, 50.0), i, 100.0) * n);
	end
	return tmp
end

Wolfram

code[i_, n_] := If[LessEqual[i, -2000000000000.0], 0.0, N[(N[(N[(16.666666666666668 * i + 50.0), $MachinePrecision] * i + 100.0), $MachinePrecision] * n), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if i < -2e12

   1. Initial program 62.9%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 61.6

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 61.6%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto \color{blue}{100 \cdot \frac{n + -1 \cdot n}{i}} \]
   6. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left(n + -1 \cdot n\right)}{i}} \]

      2. distribute-rgt1-in N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot n\right)}}{i} \]

      3. metadata-eval N/A

         \[\leadsto \frac{100 \cdot \left(\color{blue}{0} \cdot n\right)}{i} \]

      4. mul0-lft N/A

         \[\leadsto \frac{100 \cdot \color{blue}{0}}{i} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{0}}{i} \]

      6. lower-/.f64 26.3

         \[\leadsto \color{blue}{\frac{0}{i}} \]

   7. Applied rewrites 26.3%

      \[\leadsto \color{blue}{\frac{0}{i}} \]
   8. Step-by-step derivation

   9. Applied rewrites 26.3%

      \[\leadsto \color{blue}{0} \]

   if -2e12 < i

   1. Initial program 20.4%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 79.1

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 79.1%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]

   6. Taylor expanded in i around 0

      \[\leadsto \left(100 + i \cdot \left(50 + \frac{50}{3} \cdot i\right)\right) \cdot n \]
   7. Step-by-step derivation

   8. Applied rewrites 73.6%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(16.666666666666668, i, 50\right), i, 100\right) \cdot n \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 59.6% accurate, 8.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq -3300000000000:\\ \;\;\;\;0\\ \mathbf{elif}\;i \leq 0.0036:\\ \;\;\;\;100 \cdot n\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (if (<= i -3300000000000.0) 0.0 (if (<= i 0.0036) (* 100.0 n) 0.0)))

C

double code(double i, double n) {
	double tmp;
	if (i <= -3300000000000.0) {
		tmp = 0.0;
	} else if (i <= 0.0036) {
		tmp = 100.0 * n;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(i, n)
    real(8), intent (in) :: i
    real(8), intent (in) :: n
    real(8) :: tmp
    if (i <= (-3300000000000.0d0)) then
        tmp = 0.0d0
    else if (i <= 0.0036d0) then
        tmp = 100.0d0 * n
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double i, double n) {
	double tmp;
	if (i <= -3300000000000.0) {
		tmp = 0.0;
	} else if (i <= 0.0036) {
		tmp = 100.0 * n;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(i, n):
	tmp = 0
	if i <= -3300000000000.0:
		tmp = 0.0
	elif i <= 0.0036:
		tmp = 100.0 * n
	else:
		tmp = 0.0
	return tmp

Julia

function code(i, n)
	tmp = 0.0
	if (i <= -3300000000000.0)
		tmp = 0.0;
	elseif (i <= 0.0036)
		tmp = Float64(100.0 * n);
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(i, n)
	tmp = 0.0;
	if (i <= -3300000000000.0)
		tmp = 0.0;
	elseif (i <= 0.0036)
		tmp = 100.0 * n;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[i_, n_] := If[LessEqual[i, -3300000000000.0], 0.0, If[LessEqual[i, 0.0036], N[(100.0 * n), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if i < -3.3e12 or 0.0035999999999999999 < i

   1. Initial program 57.0%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 56.3

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 56.3%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto \color{blue}{100 \cdot \frac{n + -1 \cdot n}{i}} \]
   6. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left(n + -1 \cdot n\right)}{i}} \]

      2. distribute-rgt1-in N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot n\right)}}{i} \]

      3. metadata-eval N/A

         \[\leadsto \frac{100 \cdot \left(\color{blue}{0} \cdot n\right)}{i} \]

      4. mul0-lft N/A

         \[\leadsto \frac{100 \cdot \color{blue}{0}}{i} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{0}}{i} \]

      6. lower-/.f64 21.7

         \[\leadsto \color{blue}{\frac{0}{i}} \]

   7. Applied rewrites 21.7%

      \[\leadsto \color{blue}{\frac{0}{i}} \]
   8. Step-by-step derivation

   9. Applied rewrites 21.7%

      \[\leadsto \color{blue}{0} \]

   if -3.3e12 < i < 0.0035999999999999999

   1. Initial program 8.2%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in i around 0

      \[\leadsto \color{blue}{100 \cdot n} \]
   4. Step-by-step derivation

      1. lower-*.f64 82.5

         \[\leadsto \color{blue}{100 \cdot n} \]

   5. Applied rewrites 82.5%

      \[\leadsto \color{blue}{100 \cdot n} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 60.1% accurate, 8.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;i \leq -0.65:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(50, i, 100\right) \cdot n\\ \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (if (<= i -0.65) 0.0 (* (fma 50.0 i 100.0) n)))

C

double code(double i, double n) {
	double tmp;
	if (i <= -0.65) {
		tmp = 0.0;
	} else {
		tmp = fma(50.0, i, 100.0) * n;
	}
	return tmp;
}

Julia

function code(i, n)
	tmp = 0.0
	if (i <= -0.65)
		tmp = 0.0;
	else
		tmp = Float64(fma(50.0, i, 100.0) * n);
	end
	return tmp
end

Wolfram

code[i_, n_] := If[LessEqual[i, -0.65], 0.0, N[(N[(50.0 * i + 100.0), $MachinePrecision] * n), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if i < -0.650000000000000022

   1. Initial program 61.1%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

      2. lift--.f64 N/A

         \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

      3. div-sub N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

      4. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

      5. clear-num N/A

         \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

      6. sub-neg N/A

         \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

      7. div-inv N/A

         \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      8. lift-/.f64 N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      9. clear-num N/A

         \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

      11. lift-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      12. +-commutative N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      13. lower-+.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      14. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

      15. distribute-neg-frac N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      16. lower-/.f64 N/A

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

      17. lower-neg.f64 59.8

          \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

   4. Applied rewrites 59.8%

      \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

   5. Taylor expanded in i around 0

      \[\leadsto \color{blue}{100 \cdot \frac{n + -1 \cdot n}{i}} \]
   6. Step-by-step derivation

      1. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{100 \cdot \left(n + -1 \cdot n\right)}{i}} \]

      2. distribute-rgt1-in N/A

         \[\leadsto \frac{100 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot n\right)}}{i} \]

      3. metadata-eval N/A

         \[\leadsto \frac{100 \cdot \left(\color{blue}{0} \cdot n\right)}{i} \]

      4. mul0-lft N/A

         \[\leadsto \frac{100 \cdot \color{blue}{0}}{i} \]

      5. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{0}}{i} \]

      6. lower-/.f64 25.6

         \[\leadsto \color{blue}{\frac{0}{i}} \]

   7. Applied rewrites 25.6%

      \[\leadsto \color{blue}{\frac{0}{i}} \]
   8. Step-by-step derivation

   9. Applied rewrites 25.6%

      \[\leadsto \color{blue}{0} \]

   if -0.650000000000000022 < i

   1. Initial program 20.6%

      \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
   2. Add Preprocessing

   3. Taylor expanded in n around inf

      \[\leadsto \color{blue}{100 \cdot \frac{n \cdot \left(e^{i} - 1\right)}{i}} \]
   4. Step-by-step derivation

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-expm1.f64 78.9

         \[\leadsto \left(\frac{\color{blue}{\mathsf{expm1}\left(i\right)}}{i} \cdot 100\right) \cdot n \]

   5. Applied rewrites 78.9%

      \[\leadsto \color{blue}{\left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot 100\right) \cdot n} \]

   6. Taylor expanded in i around 0

      \[\leadsto \left(100 + 50 \cdot i\right) \cdot n \]
   7. Step-by-step derivation

   8. Applied rewrites 70.8%

      \[\leadsto \mathsf{fma}\left(50, i, 100\right) \cdot n \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 15: 17.4% accurate, 146.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (i n) :precision binary64 0.0)

C

double code(double i, double n) {
	return 0.0;
}

Fortran

real(8) function code(i, n)
    real(8), intent (in) :: i
    real(8), intent (in) :: n
    code = 0.0d0
end function

Java

public static double code(double i, double n) {
	return 0.0;
}

Python

def code(i, n):
	return 0.0

Julia

function code(i, n)
	return 0.0
end

MATLAB

function tmp = code(i, n)
	tmp = 0.0;
end

Wolfram

code[i_, n_] := 0.0

Derivation

1. Initial program 30.9%

   \[100 \cdot \frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto 100 \cdot \color{blue}{\frac{{\left(1 + \frac{i}{n}\right)}^{n} - 1}{\frac{i}{n}}} \]

   2. lift--.f64 N/A

      \[\leadsto 100 \cdot \frac{\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} - 1}}{\frac{i}{n}} \]

   3. div-sub N/A

      \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\frac{i}{n}}\right)} \]

   4. lift-/.f64 N/A

      \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \frac{1}{\color{blue}{\frac{i}{n}}}\right) \]

   5. clear-num N/A

      \[\leadsto 100 \cdot \left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} - \color{blue}{\frac{n}{i}}\right) \]

   6. sub-neg N/A

      \[\leadsto 100 \cdot \color{blue}{\left(\frac{{\left(1 + \frac{i}{n}\right)}^{n}}{\frac{i}{n}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right)} \]

   7. div-inv N/A

      \[\leadsto 100 \cdot \left(\color{blue}{{\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

   8. lift-/.f64 N/A

      \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \frac{1}{\color{blue}{\frac{i}{n}}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

   9. clear-num N/A

      \[\leadsto 100 \cdot \left({\left(1 + \frac{i}{n}\right)}^{n} \cdot \color{blue}{\frac{n}{i}} + \left(\mathsf{neg}\left(\frac{n}{i}\right)\right)\right) \]

   10. lower-fma.f64 N/A

       \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(1 + \frac{i}{n}\right)}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right)} \]

   11. lift-+.f64 N/A

       \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(1 + \frac{i}{n}\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

   12. +-commutative N/A

       \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

   13. lower-+.f64 N/A

       \[\leadsto 100 \cdot \mathsf{fma}\left({\color{blue}{\left(\frac{i}{n} + 1\right)}}^{n}, \frac{n}{i}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

   14. lower-/.f64 N/A

       \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \color{blue}{\frac{n}{i}}, \mathsf{neg}\left(\frac{n}{i}\right)\right) \]

   15. distribute-neg-frac N/A

       \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

   16. lower-/.f64 N/A

       \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \color{blue}{\frac{\mathsf{neg}\left(n\right)}{i}}\right) \]

   17. lower-neg.f64 30.5

       \[\leadsto 100 \cdot \mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{\color{blue}{-n}}{i}\right) \]

4. Applied rewrites 30.5%

   \[\leadsto 100 \cdot \color{blue}{\mathsf{fma}\left({\left(\frac{i}{n} + 1\right)}^{n}, \frac{n}{i}, \frac{-n}{i}\right)} \]

5. Taylor expanded in i around 0

   \[\leadsto \color{blue}{100 \cdot \frac{n + -1 \cdot n}{i}} \]
6. Step-by-step derivation

   1. associate-*r/ N/A

      \[\leadsto \color{blue}{\frac{100 \cdot \left(n + -1 \cdot n\right)}{i}} \]

   2. distribute-rgt1-in N/A

      \[\leadsto \frac{100 \cdot \color{blue}{\left(\left(-1 + 1\right) \cdot n\right)}}{i} \]

   3. metadata-eval N/A

      \[\leadsto \frac{100 \cdot \left(\color{blue}{0} \cdot n\right)}{i} \]

   4. mul0-lft N/A

      \[\leadsto \frac{100 \cdot \color{blue}{0}}{i} \]

   5. metadata-eval N/A

      \[\leadsto \frac{\color{blue}{0}}{i} \]

   6. lower-/.f64 14.4

      \[\leadsto \color{blue}{\frac{0}{i}} \]

7. Applied rewrites 14.4%

   \[\leadsto \color{blue}{\frac{0}{i}} \]
8. Step-by-step derivation

9. Applied rewrites 14.4%

   \[\leadsto \color{blue}{0} \]
10. Add Preprocessing

Developer Target 1: 33.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + \frac{i}{n}\\ 100 \cdot \frac{e^{n \cdot \begin{array}{l} \mathbf{if}\;t\_0 = 1:\\ \;\;\;\;\frac{i}{n}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{i}{n} \cdot \log t\_0}{\left(\frac{i}{n} + 1\right) - 1}\\ \end{array}} - 1}{\frac{i}{n}} \end{array} \end{array} \]

FPCore

(FPCore (i n)
 :precision binary64
 (let* ((t_0 (+ 1.0 (/ i n))))
   (*
    100.0
    (/
     (-
      (exp
       (*
        n
        (if (== t_0 1.0)
          (/ i n)
          (/ (* (/ i n) (log t_0)) (- (+ (/ i n) 1.0) 1.0)))))
      1.0)
     (/ i n)))))

C

double code(double i, double n) {
	double t_0 = 1.0 + (i / n);
	double tmp;
	if (t_0 == 1.0) {
		tmp = i / n;
	} else {
		tmp = ((i / n) * log(t_0)) / (((i / n) + 1.0) - 1.0);
	}
	return 100.0 * ((exp((n * tmp)) - 1.0) / (i / n));
}

Fortran

real(8) function code(i, n)
    real(8), intent (in) :: i
    real(8), intent (in) :: n
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 1.0d0 + (i / n)
    if (t_0 == 1.0d0) then
        tmp = i / n
    else
        tmp = ((i / n) * log(t_0)) / (((i / n) + 1.0d0) - 1.0d0)
    end if
    code = 100.0d0 * ((exp((n * tmp)) - 1.0d0) / (i / n))
end function

Java

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

Python

def code(i, n):
	t_0 = 1.0 + (i / n)
	tmp = 0
	if t_0 == 1.0:
		tmp = i / n
	else:
		tmp = ((i / n) * math.log(t_0)) / (((i / n) + 1.0) - 1.0)
	return 100.0 * ((math.exp((n * tmp)) - 1.0) / (i / n))

Julia

function code(i, n)
	t_0 = Float64(1.0 + Float64(i / n))
	tmp = 0.0
	if (t_0 == 1.0)
		tmp = Float64(i / n);
	else
		tmp = Float64(Float64(Float64(i / n) * log(t_0)) / Float64(Float64(Float64(i / n) + 1.0) - 1.0));
	end
	return Float64(100.0 * Float64(Float64(exp(Float64(n * tmp)) - 1.0) / Float64(i / n)))
end

MATLAB

function tmp_2 = code(i, n)
	t_0 = 1.0 + (i / n);
	tmp = 0.0;
	if (t_0 == 1.0)
		tmp = i / n;
	else
		tmp = ((i / n) * log(t_0)) / (((i / n) + 1.0) - 1.0);
	end
	tmp_2 = 100.0 * ((exp((n * tmp)) - 1.0) / (i / n));
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(1.0 + N[(i / n), $MachinePrecision]), $MachinePrecision]}, N[(100.0 * N[(N[(N[Exp[N[(n * If[Equal[t$95$0, 1.0], N[(i / n), $MachinePrecision], N[(N[(N[(i / n), $MachinePrecision] * N[Log[t$95$0], $MachinePrecision]), $MachinePrecision] / N[(N[(N[(i / n), $MachinePrecision] + 1.0), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]], $MachinePrecision] - 1.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2024296 
(FPCore (i n)
  :name "Compound Interest"
  :precision binary64

  :alt
  (! :herbie-platform default (let ((lnbase (if (== (+ 1 (/ i n)) 1) (/ i n) (/ (* (/ i n) (log (+ 1 (/ i n)))) (- (+ (/ i n) 1) 1))))) (* 100 (/ (- (exp (* n lnbase)) 1) (/ i n)))))

  (* 100.0 (/ (- (pow (+ 1.0 (/ i n)) n) 1.0) (/ i n))))