Compound Interest

Percentage Accurate: 28.6% → 81.0%

Time: 8.5s

Alternatives: 9

Speedup: 9.4×

• could not determine a ground truth

  1. i = 6.974585722785665e-22
  2. n = 1.5327415654041608e+28

Specification

Math

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

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(i, n)
use fmin_fmax_functions
    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: 28.6% accurate, 1.0× speedup

Math

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

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(i, n)
use fmin_fmax_functions
    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: 81.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} t_0 := 100 \cdot \left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot n\right)\\ \mathbf{if}\;n \leq 2.5 \cdot 10^{-308}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n \leq 1.16 \cdot 10^{-40}:\\ \;\;\;\;\left(n \cdot \left(\log i + \mathsf{fma}\left(-1, \log n, n \cdot \mathsf{fma}\left(0.5, {\left(\log i + -1 \cdot \log n\right)}^{2}, \frac{1}{i}\right)\right)\right)\right) \cdot \left(\frac{n}{i} \cdot 100\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \]

FPCore

(FPCore (i n)
  :precision binary64
  (let* ((t_0 (* 100.0 (* (/ (expm1 i) i) n))))
  (if (<= n 2.5e-308)
    t_0
    (if (<= n 1.16e-40)
      (*
       (*
        n
        (+
         (log i)
         (fma
          -1.0
          (log n)
          (*
           n
           (fma
            0.5
            (pow (+ (log i) (* -1.0 (log n))) 2.0)
            (/ 1.0 i))))))
       (* (/ n i) 100.0))
      t_0))))

C

double code(double i, double n) {
	double t_0 = 100.0 * ((expm1(i) / i) * n);
	double tmp;
	if (n <= 2.5e-308) {
		tmp = t_0;
	} else if (n <= 1.16e-40) {
		tmp = (n * (log(i) + fma(-1.0, log(n), (n * fma(0.5, pow((log(i) + (-1.0 * log(n))), 2.0), (1.0 / i)))))) * ((n / i) * 100.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(i, n)
	t_0 = Float64(100.0 * Float64(Float64(expm1(i) / i) * n))
	tmp = 0.0
	if (n <= 2.5e-308)
		tmp = t_0;
	elseif (n <= 1.16e-40)
		tmp = Float64(Float64(n * Float64(log(i) + fma(-1.0, log(n), Float64(n * fma(0.5, (Float64(log(i) + Float64(-1.0 * log(n))) ^ 2.0), Float64(1.0 / i)))))) * Float64(Float64(n / i) * 100.0));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(100.0 * N[(N[(N[(Exp[i] - 1), $MachinePrecision] / i), $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, 2.5e-308], t$95$0, If[LessEqual[n, 1.16e-40], N[(N[(n * N[(N[Log[i], $MachinePrecision] + N[(-1.0 * N[Log[n], $MachinePrecision] + N[(n * N[(0.5 * N[Power[N[(N[Log[i], $MachinePrecision] + N[(-1.0 * N[Log[n], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(1.0 / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(n / i), $MachinePrecision] * 100.0), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if n < 2.4999999999999998e-308 or 1.1599999999999999e-40 < n

   1. Initial program 28.6%

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

   2. Taylor expanded in n around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 71.6%

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

   4. Applied rewrites 71.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 75.9%

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

   6. Applied rewrites 75.9%

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

   if 2.4999999999999998e-308 < n < 1.1599999999999999e-40

   1. Initial program 28.6%

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

   2. Taylor expanded in n around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-log.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-log.f64 10.9%

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

   4. Applied rewrites 10.9%

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

   6. Applied rewrites 15.7%

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

   7. Taylor expanded in n around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-log.f64 N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-log.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-fma.f64 N/A

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

   9. Applied rewrites 16.3%

      \[\leadsto \color{blue}{\left(n \cdot \left(\log i + \mathsf{fma}\left(-1, \log n, n \cdot \mathsf{fma}\left(0.5, {\left(\log i + -1 \cdot \log n\right)}^{2}, \frac{1}{i}\right)\right)\right)\right)} \cdot \left(\frac{n}{i} \cdot 100\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 80.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} t_0 := 100 \cdot \left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot n\right)\\ \mathbf{if}\;n \leq 2.5 \cdot 10^{-308}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n \leq 1.16 \cdot 10^{-40}:\\ \;\;\;\;100 \cdot \frac{n \cdot \left(\log i + -1 \cdot \log n\right)}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \]

FPCore

(FPCore (i n)
  :precision binary64
  (let* ((t_0 (* 100.0 (* (/ (expm1 i) i) n))))
  (if (<= n 2.5e-308)
    t_0
    (if (<= n 1.16e-40)
      (* 100.0 (/ (* n (+ (log i) (* -1.0 (log n)))) (/ i n)))
      t_0))))

C

double code(double i, double n) {
	double t_0 = 100.0 * ((expm1(i) / i) * n);
	double tmp;
	if (n <= 2.5e-308) {
		tmp = t_0;
	} else if (n <= 1.16e-40) {
		tmp = 100.0 * ((n * (log(i) + (-1.0 * log(n)))) / (i / n));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double i, double n) {
	double t_0 = 100.0 * ((Math.expm1(i) / i) * n);
	double tmp;
	if (n <= 2.5e-308) {
		tmp = t_0;
	} else if (n <= 1.16e-40) {
		tmp = 100.0 * ((n * (Math.log(i) + (-1.0 * Math.log(n)))) / (i / n));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(i, n):
	t_0 = 100.0 * ((math.expm1(i) / i) * n)
	tmp = 0
	if n <= 2.5e-308:
		tmp = t_0
	elif n <= 1.16e-40:
		tmp = 100.0 * ((n * (math.log(i) + (-1.0 * math.log(n)))) / (i / n))
	else:
		tmp = t_0
	return tmp

Julia

function code(i, n)
	t_0 = Float64(100.0 * Float64(Float64(expm1(i) / i) * n))
	tmp = 0.0
	if (n <= 2.5e-308)
		tmp = t_0;
	elseif (n <= 1.16e-40)
		tmp = Float64(100.0 * Float64(Float64(n * Float64(log(i) + Float64(-1.0 * log(n)))) / Float64(i / n)));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if n < 2.4999999999999998e-308 or 1.1599999999999999e-40 < n

   1. Initial program 28.6%

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

   2. Taylor expanded in n around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 71.6%

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

   4. Applied rewrites 71.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 75.9%

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

   6. Applied rewrites 75.9%

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

   if 2.4999999999999998e-308 < n < 1.1599999999999999e-40

   1. Initial program 28.6%

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

   2. Taylor expanded in n around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-log.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-log.f64 10.9%

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

   4. Applied rewrites 10.9%

      \[\leadsto 100 \cdot \frac{\color{blue}{n \cdot \left(\log i + -1 \cdot \log n\right)}}{\frac{i}{n}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 79.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} t_0 := 100 \cdot \left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot n\right)\\ \mathbf{if}\;n \leq -3.1 \cdot 10^{-217}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n \leq 4 \cdot 10^{-159}:\\ \;\;\;\;100 \cdot \frac{{1}^{n} - 1}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \]

FPCore

(FPCore (i n)
  :precision binary64
  (let* ((t_0 (* 100.0 (* (/ (expm1 i) i) n))))
  (if (<= n -3.1e-217)
    t_0
    (if (<= n 4e-159) (* 100.0 (/ (- (pow 1.0 n) 1.0) (/ i n))) t_0))))

C

double code(double i, double n) {
	double t_0 = 100.0 * ((expm1(i) / i) * n);
	double tmp;
	if (n <= -3.1e-217) {
		tmp = t_0;
	} else if (n <= 4e-159) {
		tmp = 100.0 * ((pow(1.0, n) - 1.0) / (i / n));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double i, double n) {
	double t_0 = 100.0 * ((Math.expm1(i) / i) * n);
	double tmp;
	if (n <= -3.1e-217) {
		tmp = t_0;
	} else if (n <= 4e-159) {
		tmp = 100.0 * ((Math.pow(1.0, n) - 1.0) / (i / n));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(i, n):
	t_0 = 100.0 * ((math.expm1(i) / i) * n)
	tmp = 0
	if n <= -3.1e-217:
		tmp = t_0
	elif n <= 4e-159:
		tmp = 100.0 * ((math.pow(1.0, n) - 1.0) / (i / n))
	else:
		tmp = t_0
	return tmp

Julia

function code(i, n)
	t_0 = Float64(100.0 * Float64(Float64(expm1(i) / i) * n))
	tmp = 0.0
	if (n <= -3.1e-217)
		tmp = t_0;
	elseif (n <= 4e-159)
		tmp = Float64(100.0 * Float64(Float64((1.0 ^ n) - 1.0) / Float64(i / n)));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(100.0 * N[(N[(N[(Exp[i] - 1), $MachinePrecision] / i), $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -3.1e-217], t$95$0, If[LessEqual[n, 4e-159], N[(100.0 * N[(N[(N[Power[1.0, n], $MachinePrecision] - 1.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if n < -3.0999999999999999e-217 or 4e-159 < n

   1. Initial program 28.6%

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

   2. Taylor expanded in n around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 71.6%

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

   4. Applied rewrites 71.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 75.9%

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

   6. Applied rewrites 75.9%

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

   if -3.0999999999999999e-217 < n < 4e-159

   1. Initial program 28.6%

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

   2. Taylor expanded in i around 0

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

   4. Applied rewrites 17.3%

      \[\leadsto 100 \cdot \frac{{\color{blue}{1}}^{n} - 1}{\frac{i}{n}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 79.7% accurate, 1.5× speedup

Math

\[\begin{array}{l} t_0 := 100 \cdot \left(\frac{\mathsf{expm1}\left(i\right)}{i} \cdot n\right)\\ \mathbf{if}\;n \leq -3.1 \cdot 10^{-217}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n \leq 5.8 \cdot 10^{-160}:\\ \;\;\;\;100 \cdot \frac{\left(1 + i\right) - 1}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \]

FPCore

(FPCore (i n)
  :precision binary64
  (let* ((t_0 (* 100.0 (* (/ (expm1 i) i) n))))
  (if (<= n -3.1e-217)
    t_0
    (if (<= n 5.8e-160) (* 100.0 (/ (- (+ 1.0 i) 1.0) (/ i n))) t_0))))

C

double code(double i, double n) {
	double t_0 = 100.0 * ((expm1(i) / i) * n);
	double tmp;
	if (n <= -3.1e-217) {
		tmp = t_0;
	} else if (n <= 5.8e-160) {
		tmp = 100.0 * (((1.0 + i) - 1.0) / (i / n));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double i, double n) {
	double t_0 = 100.0 * ((Math.expm1(i) / i) * n);
	double tmp;
	if (n <= -3.1e-217) {
		tmp = t_0;
	} else if (n <= 5.8e-160) {
		tmp = 100.0 * (((1.0 + i) - 1.0) / (i / n));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(i, n):
	t_0 = 100.0 * ((math.expm1(i) / i) * n)
	tmp = 0
	if n <= -3.1e-217:
		tmp = t_0
	elif n <= 5.8e-160:
		tmp = 100.0 * (((1.0 + i) - 1.0) / (i / n))
	else:
		tmp = t_0
	return tmp

Julia

function code(i, n)
	t_0 = Float64(100.0 * Float64(Float64(expm1(i) / i) * n))
	tmp = 0.0
	if (n <= -3.1e-217)
		tmp = t_0;
	elseif (n <= 5.8e-160)
		tmp = Float64(100.0 * Float64(Float64(Float64(1.0 + i) - 1.0) / Float64(i / n)));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(100.0 * N[(N[(N[(Exp[i] - 1), $MachinePrecision] / i), $MachinePrecision] * n), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[n, -3.1e-217], t$95$0, If[LessEqual[n, 5.8e-160], N[(100.0 * N[(N[(N[(1.0 + i), $MachinePrecision] - 1.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if n < -3.0999999999999999e-217 or 5.7999999999999998e-160 < n

   1. Initial program 28.6%

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

   2. Taylor expanded in n around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 71.6%

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

   4. Applied rewrites 71.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 75.9%

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

   6. Applied rewrites 75.9%

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

   if -3.0999999999999999e-217 < n < 5.7999999999999998e-160

   1. Initial program 28.6%

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

   2. Taylor expanded in i around 0

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

      1. lower-+.f64 15.4%

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

   4. Applied rewrites 15.4%

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

Alternative 5: 74.6% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (i n)
  :precision binary64
  (if (<=
     (* 100.0 (/ (- (pow (+ 1.0 (/ i n)) n) 1.0) (/ i n)))
     INFINITY)
  (* 100.0 (* (expm1 i) (/ n i)))
  (* 100.0 n)))

C

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

Java

public static double code(double i, double n) {
	double tmp;
	if ((100.0 * ((Math.pow((1.0 + (i / n)), n) - 1.0) / (i / n))) <= Double.POSITIVE_INFINITY) {
		tmp = 100.0 * (Math.expm1(i) * (n / i));
	} else {
		tmp = 100.0 * n;
	}
	return tmp;
}

Python

def code(i, n):
	tmp = 0
	if (100.0 * ((math.pow((1.0 + (i / n)), n) - 1.0) / (i / n))) <= math.inf:
		tmp = 100.0 * (math.expm1(i) * (n / i))
	else:
		tmp = 100.0 * n
	return tmp

Julia

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

Wolfram

code[i_, n_] := If[LessEqual[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], Infinity], N[(100.0 * N[(N[(Exp[i] - 1), $MachinePrecision] * N[(n / i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(100.0 * n), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 100 binary64) (/.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 28.6%

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

   2. Taylor expanded in n around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 71.6%

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

   4. Applied rewrites 71.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 75.9%

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

   6. Applied rewrites 75.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. associate-/l* N/A

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

      5. div-flip-rev N/A

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

      6. lift-/.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lift-/.f64 N/A

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

      9. div-flip-rev N/A

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

      10. lift-/.f64 61.2%

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

   8. Applied rewrites 61.2%

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

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

   1. Initial program 28.6%

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

   2. Taylor expanded in i around 0

      \[\leadsto 100 \cdot \color{blue}{n} \]
   3. Step-by-step derivation

   4. Applied rewrites 48.5%

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

Alternative 6: 60.4% accurate, 1.5× speedup

Math

\[\begin{array}{l} t_0 := \mathsf{fma}\left(0.5 \cdot n, i, n\right) \cdot 100\\ \mathbf{if}\;n \leq -2.4 \cdot 10^{-165}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;n \leq 6.5 \cdot 10^{-156}:\\ \;\;\;\;100 \cdot \frac{\left(1 + i\right) - 1}{\frac{i}{n}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \]

FPCore

(FPCore (i n)
  :precision binary64
  (let* ((t_0 (* (fma (* 0.5 n) i n) 100.0)))
  (if (<= n -2.4e-165)
    t_0
    (if (<= n 6.5e-156) (* 100.0 (/ (- (+ 1.0 i) 1.0) (/ i n))) t_0))))

C

double code(double i, double n) {
	double t_0 = fma((0.5 * n), i, n) * 100.0;
	double tmp;
	if (n <= -2.4e-165) {
		tmp = t_0;
	} else if (n <= 6.5e-156) {
		tmp = 100.0 * (((1.0 + i) - 1.0) / (i / n));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(i, n)
	t_0 = Float64(fma(Float64(0.5 * n), i, n) * 100.0)
	tmp = 0.0
	if (n <= -2.4e-165)
		tmp = t_0;
	elseif (n <= 6.5e-156)
		tmp = Float64(100.0 * Float64(Float64(Float64(1.0 + i) - 1.0) / Float64(i / n)));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[i_, n_] := Block[{t$95$0 = N[(N[(N[(0.5 * n), $MachinePrecision] * i + n), $MachinePrecision] * 100.0), $MachinePrecision]}, If[LessEqual[n, -2.4e-165], t$95$0, If[LessEqual[n, 6.5e-156], N[(100.0 * N[(N[(N[(1.0 + i), $MachinePrecision] - 1.0), $MachinePrecision] / N[(i / n), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if n < -2.4000000000000002e-165 or 6.5000000000000002e-156 < n

   1. Initial program 28.6%

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

   2. Taylor expanded in n around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 71.6%

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

   4. Applied rewrites 71.6%

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

   5. Taylor expanded in i around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(\frac{1}{2}, n, i \cdot \left(\frac{1}{24} \cdot \left(i \cdot n\right) + \frac{1}{6} \cdot n\right)\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(\frac{1}{2}, n, i \cdot \left(\frac{1}{24} \cdot \left(i \cdot n\right) + \frac{1}{6} \cdot n\right)\right)\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(\frac{1}{2}, n, i \cdot \mathsf{fma}\left(\frac{1}{24}, i \cdot n, \frac{1}{6} \cdot n\right)\right)\right) \]

      6. lower-*.f64 N/A

         \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(\frac{1}{2}, n, i \cdot \mathsf{fma}\left(\frac{1}{24}, i \cdot n, \frac{1}{6} \cdot n\right)\right)\right) \]

      7. lower-*.f64 58.4%

         \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(0.5, n, i \cdot \mathsf{fma}\left(0.041666666666666664, i \cdot n, 0.16666666666666666 \cdot n\right)\right)\right) \]

   7. Applied rewrites 58.4%

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

   8. Taylor expanded in i around 0

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

      1. lower-*.f64 54.2%

         \[\leadsto 100 \cdot \left(n + i \cdot \left(0.5 \cdot n\right)\right) \]

   10. Applied rewrites 54.2%

       \[\leadsto 100 \cdot \left(n + i \cdot \left(0.5 \cdot n\right)\right) \]
   11. Step-by-step derivation

       1. lift-*.f64 N/A

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

       2. *-commutative N/A

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

       3. lower-*.f64 54.2%

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

   12. Applied rewrites 54.2%

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

   if -2.4000000000000002e-165 < n < 6.5000000000000002e-156

   1. Initial program 28.6%

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

   2. Taylor expanded in i around 0

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

      1. lower-+.f64 15.4%

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

   4. Applied rewrites 15.4%

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

Alternative 7: 54.2% accurate, 2.6× speedup

Math

\[\begin{array}{l} \mathbf{if}\;i \leq 7.5 \cdot 10^{-232}:\\ \;\;\;\;100 \cdot n\\ \mathbf{else}:\\ \;\;\;\;100 \cdot \frac{i \cdot n}{i}\\ \end{array} \]

FPCore

(FPCore (i n)
  :precision binary64
  (if (<= i 7.5e-232) (* 100.0 n) (* 100.0 (/ (* i n) i))))

C

double code(double i, double n) {
	double tmp;
	if (i <= 7.5e-232) {
		tmp = 100.0 * n;
	} else {
		tmp = 100.0 * ((i * n) / i);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(i, n)
use fmin_fmax_functions
    real(8), intent (in) :: i
    real(8), intent (in) :: n
    real(8) :: tmp
    if (i <= 7.5d-232) then
        tmp = 100.0d0 * n
    else
        tmp = 100.0d0 * ((i * n) / i)
    end if
    code = tmp
end function

Java

public static double code(double i, double n) {
	double tmp;
	if (i <= 7.5e-232) {
		tmp = 100.0 * n;
	} else {
		tmp = 100.0 * ((i * n) / i);
	}
	return tmp;
}

Python

def code(i, n):
	tmp = 0
	if i <= 7.5e-232:
		tmp = 100.0 * n
	else:
		tmp = 100.0 * ((i * n) / i)
	return tmp

Julia

function code(i, n)
	tmp = 0.0
	if (i <= 7.5e-232)
		tmp = Float64(100.0 * n);
	else
		tmp = Float64(100.0 * Float64(Float64(i * n) / i));
	end
	return tmp
end

MATLAB

function tmp_2 = code(i, n)
	tmp = 0.0;
	if (i <= 7.5e-232)
		tmp = 100.0 * n;
	else
		tmp = 100.0 * ((i * n) / i);
	end
	tmp_2 = tmp;
end

Wolfram

code[i_, n_] := If[LessEqual[i, 7.5e-232], N[(100.0 * n), $MachinePrecision], N[(100.0 * N[(N[(i * n), $MachinePrecision] / i), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if i < 7.5000000000000006e-232

   1. Initial program 28.6%

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

   2. Taylor expanded in i around 0

      \[\leadsto 100 \cdot \color{blue}{n} \]
   3. Step-by-step derivation

   4. Applied rewrites 48.5%

      \[\leadsto 100 \cdot \color{blue}{n} \]

   if 7.5000000000000006e-232 < i

   1. Initial program 28.6%

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

   2. Taylor expanded in n around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-expm1.f64 71.6%

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

   4. Applied rewrites 71.6%

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

   5. Taylor expanded in i around 0

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

      1. lower-*.f64 49.6%

         \[\leadsto 100 \cdot \frac{i \cdot n}{i} \]

   7. Applied rewrites 49.6%

      \[\leadsto 100 \cdot \frac{i \cdot n}{i} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 54.1% accurate, 3.1× speedup

Math

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

FPCore

(FPCore (i n)
  :precision binary64
  (* (fma (* 0.5 n) i n) 100.0))

C

double code(double i, double n) {
	return fma((0.5 * n), i, n) * 100.0;
}

Julia

function code(i, n)
	return Float64(fma(Float64(0.5 * n), i, n) * 100.0)
end

Wolfram

code[i_, n_] := N[(N[(N[(0.5 * n), $MachinePrecision] * i + n), $MachinePrecision] * 100.0), $MachinePrecision]

Derivation

1. Initial program 28.6%

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

2. Taylor expanded in n around inf

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

   1. lower-/.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower-expm1.f64 71.6%

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

4. Applied rewrites 71.6%

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

5. Taylor expanded in i around 0

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

   1. lower-+.f64 N/A

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

   2. lower-*.f64 N/A

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

   3. lower-fma.f64 N/A

      \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(\frac{1}{2}, n, i \cdot \left(\frac{1}{24} \cdot \left(i \cdot n\right) + \frac{1}{6} \cdot n\right)\right)\right) \]

   4. lower-*.f64 N/A

      \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(\frac{1}{2}, n, i \cdot \left(\frac{1}{24} \cdot \left(i \cdot n\right) + \frac{1}{6} \cdot n\right)\right)\right) \]

   5. lower-fma.f64 N/A

      \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(\frac{1}{2}, n, i \cdot \mathsf{fma}\left(\frac{1}{24}, i \cdot n, \frac{1}{6} \cdot n\right)\right)\right) \]

   6. lower-*.f64 N/A

      \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(\frac{1}{2}, n, i \cdot \mathsf{fma}\left(\frac{1}{24}, i \cdot n, \frac{1}{6} \cdot n\right)\right)\right) \]

   7. lower-*.f64 58.4%

      \[\leadsto 100 \cdot \left(n + i \cdot \mathsf{fma}\left(0.5, n, i \cdot \mathsf{fma}\left(0.041666666666666664, i \cdot n, 0.16666666666666666 \cdot n\right)\right)\right) \]

7. Applied rewrites 58.4%

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

8. Taylor expanded in i around 0

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

   1. lower-*.f64 54.2%

      \[\leadsto 100 \cdot \left(n + i \cdot \left(0.5 \cdot n\right)\right) \]

10. Applied rewrites 54.2%

    \[\leadsto 100 \cdot \left(n + i \cdot \left(0.5 \cdot n\right)\right) \]
11. Step-by-step derivation

    1. lift-*.f64 N/A

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

    2. *-commutative N/A

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

    3. lower-*.f64 54.2%

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

12. Applied rewrites 54.2%

    \[\leadsto \color{blue}{\mathsf{fma}\left(0.5 \cdot n, i, n\right) \cdot 100} \]
13. Add Preprocessing

Alternative 9: 48.5% accurate, 9.4× speedup

Math

\[100 \cdot n \]

FPCore

(FPCore (i n)
  :precision binary64
  (* 100.0 n))

C

double code(double i, double n) {
	return 100.0 * n;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(i, n)
use fmin_fmax_functions
    real(8), intent (in) :: i
    real(8), intent (in) :: n
    code = 100.0d0 * n
end function

Java

public static double code(double i, double n) {
	return 100.0 * n;
}

Python

def code(i, n):
	return 100.0 * n

Julia

function code(i, n)
	return Float64(100.0 * n)
end

MATLAB

function tmp = code(i, n)
	tmp = 100.0 * n;
end

Wolfram

code[i_, n_] := N[(100.0 * n), $MachinePrecision]

Derivation

1. Initial program 28.6%

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

2. Taylor expanded in i around 0

   \[\leadsto 100 \cdot \color{blue}{n} \]
3. Step-by-step derivation

4. Applied rewrites 48.5%

   \[\leadsto 100 \cdot \color{blue}{n} \]
5. Add Preprocessing

Developer Target 1: 34.8% accurate, 0.5× speedup

Math

\[\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} \]

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(i, n)
use fmin_fmax_functions
    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 2025212 
(FPCore (i n)
  :name "Compound Interest"
  :precision binary64

  :alt
  (! :herbie-platform c (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))))