expfmod (used to be hard to sample)

Percentage Accurate: 6.7% → 6.3%

Time: 19.8s

Alternatives: 7

Speedup: N/A×

• could not determine a ground truth

  1. x = -3.5486361432033117e+139

Specification

Math

\[\begin{array}{l} \\ \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))

C

double code(double x) {
	return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)

Julia

function code(x)
	return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x)))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Initial Program: 6.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))

C

double code(double x) {
	return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)

Julia

function code(x)
	return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x)))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Alternative 1: 6.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \frac{\log \left(e^{\left(\left(e^{x}\right) \bmod \left(1 + {x}^{2} \cdot -0.25\right)\right)}\right)}{e^{x}} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ (log (exp (fmod (exp x) (+ 1.0 (* (pow x 2.0) -0.25))))) (exp x)))

C

double code(double x) {
	return log(exp(fmod(exp(x), (1.0 + (pow(x, 2.0) * -0.25))))) / exp(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = log(exp(mod(exp(x), (1.0d0 + ((x ** 2.0d0) * (-0.25d0)))))) / exp(x)
end function

Python

def code(x):
	return math.log(math.exp(math.fmod(math.exp(x), (1.0 + (math.pow(x, 2.0) * -0.25))))) / math.exp(x)

Julia

function code(x)
	return Float64(log(exp(rem(exp(x), Float64(1.0 + Float64((x ^ 2.0) * -0.25))))) / exp(x))
end

Wolfram

code[x_] := N[(N[Log[N[Exp[N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(1.0 + N[(N[Power[x, 2.0], $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]], $MachinePrecision]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.0%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Step-by-step derivation

   1. exp-neg 7.0%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\frac{1}{e^{x}}} \]

   2. associate-*r/ 7.0%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot 1}{e^{x}}} \]

   3. *-rgt-identity 7.0%

      \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}}{e^{x}} \]

3. Simplified 7.0%

   \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]
4. Step-by-step derivation

   1. add-log-exp 7.0%

      \[\leadsto \frac{\color{blue}{\log \left(e^{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}\right)}}{e^{x}} \]

5. Applied egg-rr 7.0%

   \[\leadsto \frac{\color{blue}{\log \left(e^{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}\right)}}{e^{x}} \]

6. Taylor expanded in x around 0 7.0%

   \[\leadsto \frac{\log \left(e^{\left(\left(e^{x}\right) \bmod \color{blue}{\left(1 + -0.25 \cdot {x}^{2}\right)}\right)}\right)}{e^{x}} \]
7. Step-by-step derivation

   1. *-commutative 7.0%

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

8. Simplified 7.0%

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

9. Final simplification 7.0%

   \[\leadsto \frac{\log \left(e^{\left(\left(e^{x}\right) \bmod \left(1 + {x}^{2} \cdot -0.25\right)\right)}\right)}{e^{x}} \]

Alternative 2: 6.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \frac{\left(\left(e^{x}\right) \bmod \left(1 + {x}^{2} \cdot -0.25\right)\right)}{e^{x}} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ (fmod (exp x) (+ 1.0 (* (pow x 2.0) -0.25))) (exp x)))

C

double code(double x) {
	return fmod(exp(x), (1.0 + (pow(x, 2.0) * -0.25))) / exp(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod(exp(x), (1.0d0 + ((x ** 2.0d0) * (-0.25d0)))) / exp(x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), (1.0 + (math.pow(x, 2.0) * -0.25))) / math.exp(x)

Julia

function code(x)
	return Float64(rem(exp(x), Float64(1.0 + Float64((x ^ 2.0) * -0.25))) / exp(x))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(1.0 + N[(N[Power[x, 2.0], $MachinePrecision] * -0.25), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.0%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Step-by-step derivation

   1. exp-neg 7.0%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\frac{1}{e^{x}}} \]

   2. associate-*r/ 7.0%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot 1}{e^{x}}} \]

   3. *-rgt-identity 7.0%

      \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}}{e^{x}} \]

3. Simplified 7.0%

   \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]

4. Taylor expanded in x around 0 7.0%

   \[\leadsto \frac{\left(\left(e^{x}\right) \bmod \color{blue}{\left(1 + -0.25 \cdot {x}^{2}\right)}\right)}{e^{x}} \]
5. Step-by-step derivation

   1. *-commutative 7.0%

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

6. Simplified 7.0%

   \[\leadsto \frac{\left(\left(e^{x}\right) \bmod \color{blue}{\left(1 + {x}^{2} \cdot -0.25\right)}\right)}{e^{x}} \]

7. Final simplification 7.0%

   \[\leadsto \frac{\left(\left(e^{x}\right) \bmod \left(1 + {x}^{2} \cdot -0.25\right)\right)}{e^{x}} \]

Alternative 3: 6.3% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ e^{\log \left(\left(e^{x}\right) \bmod 1\right) - x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (exp (- (log (fmod (exp x) 1.0)) x)))

C

double code(double x) {
	return exp((log(fmod(exp(x), 1.0)) - x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = exp((log(mod(exp(x), 1.0d0)) - x))
end function

Python

def code(x):
	return math.exp((math.log(math.fmod(math.exp(x), 1.0)) - x))

Julia

function code(x)
	return exp(Float64(log(rem(exp(x), 1.0)) - x))
end

Wolfram

code[x_] := N[Exp[N[(N[Log[N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 7.0%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Step-by-step derivation

   1. exp-neg 7.0%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\frac{1}{e^{x}}} \]

   2. associate-*r/ 7.0%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot 1}{e^{x}}} \]

   3. *-rgt-identity 7.0%

      \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}}{e^{x}} \]

3. Simplified 7.0%

   \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]

4. Taylor expanded in x around 0 6.7%

   \[\leadsto \frac{\left(\left(e^{x}\right) \bmod \color{blue}{1}\right)}{e^{x}} \]
5. Step-by-step derivation

   1. add-exp-log 6.7%

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

   2. div-exp 6.7%

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

6. Applied egg-rr 6.7%

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

7. Final simplification 6.7%

   \[\leadsto e^{\log \left(\left(e^{x}\right) \bmod 1\right) - x} \]

Alternative 4: 6.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ 1 + \left(-1 + \frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (+ 1.0 (+ -1.0 (/ (fmod (exp x) 1.0) (exp x)))))

C

double code(double x) {
	return 1.0 + (-1.0 + (fmod(exp(x), 1.0) / exp(x)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 + ((-1.0d0) + (mod(exp(x), 1.0d0) / exp(x)))
end function

Python

def code(x):
	return 1.0 + (-1.0 + (math.fmod(math.exp(x), 1.0) / math.exp(x)))

Julia

function code(x)
	return Float64(1.0 + Float64(-1.0 + Float64(rem(exp(x), 1.0) / exp(x))))
end

Wolfram

code[x_] := N[(1.0 + N[(-1.0 + N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.0%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Step-by-step derivation

   1. exp-neg 7.0%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\frac{1}{e^{x}}} \]

   2. associate-*r/ 7.0%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot 1}{e^{x}}} \]

   3. *-rgt-identity 7.0%

      \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}}{e^{x}} \]

3. Simplified 7.0%

   \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]

4. Taylor expanded in x around 0 6.7%

   \[\leadsto \frac{\left(\left(e^{x}\right) \bmod \color{blue}{1}\right)}{e^{x}} \]
5. Step-by-step derivation

   1. expm1-log1p-u 6.7%

      \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\right)\right)} \]

   2. expm1-udef 6.7%

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

6. Applied egg-rr 6.7%

   \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\right)} - 1} \]
7. Step-by-step derivation

   1. sub-neg 6.7%

      \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\right)} + \left(-1\right)} \]

   2. +-commutative 6.7%

      \[\leadsto \color{blue}{\left(-1\right) + e^{\mathsf{log1p}\left(\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\right)}} \]

   3. log1p-udef 6.7%

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

   4. add-exp-log 6.7%

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

   5. +-commutative 6.7%

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

   6. associate-+r+ 6.7%

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

   7. metadata-eval 6.7%

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

8. Applied egg-rr 6.7%

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

9. Final simplification 6.7%

   \[\leadsto 1 + \left(-1 + \frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\right) \]

Alternative 5: 6.2% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (fmod (exp x) 1.0) (exp x)))

C

double code(double x) {
	return fmod(exp(x), 1.0) / exp(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod(exp(x), 1.0d0) / exp(x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), 1.0) / math.exp(x)

Julia

function code(x)
	return Float64(rem(exp(x), 1.0) / exp(x))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.0%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Step-by-step derivation

   1. exp-neg 7.0%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\frac{1}{e^{x}}} \]

   2. associate-*r/ 7.0%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot 1}{e^{x}}} \]

   3. *-rgt-identity 7.0%

      \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}}{e^{x}} \]

3. Simplified 7.0%

   \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]

4. Taylor expanded in x around 0 6.7%

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

5. Final simplification 6.7%

   \[\leadsto \frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}} \]

Alternative 6: 5.7% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \left(\left(e^{x}\right) \bmod 1\right) \cdot \left(1 - x\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod (exp x) 1.0) (- 1.0 x)))

C

double code(double x) {
	return fmod(exp(x), 1.0) * (1.0 - x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod(exp(x), 1.0d0) * (1.0d0 - x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), 1.0) * (1.0 - x)

Julia

function code(x)
	return Float64(rem(exp(x), 1.0) * Float64(1.0 - x))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(1.0 - x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.0%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Step-by-step derivation

   1. exp-neg 7.0%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\frac{1}{e^{x}}} \]

   2. associate-*r/ 7.0%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot 1}{e^{x}}} \]

   3. *-rgt-identity 7.0%

      \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}}{e^{x}} \]

3. Simplified 7.0%

   \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]

4. Taylor expanded in x around 0 6.7%

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

5. Taylor expanded in x around 0 6.1%

   \[\leadsto \color{blue}{-1 \cdot \left(x \cdot \left(\left(e^{x}\right) \bmod 1\right)\right) + \left(\left(e^{x}\right) \bmod 1\right)} \]
6. Step-by-step derivation

   1. +-commutative 6.1%

      \[\leadsto \color{blue}{\left(\left(e^{x}\right) \bmod 1\right) + -1 \cdot \left(x \cdot \left(\left(e^{x}\right) \bmod 1\right)\right)} \]

   2. *-lft-identity 6.1%

      \[\leadsto \color{blue}{1 \cdot \left(\left(e^{x}\right) \bmod 1\right)} + -1 \cdot \left(x \cdot \left(\left(e^{x}\right) \bmod 1\right)\right) \]

   3. associate-*r* 6.1%

      \[\leadsto 1 \cdot \left(\left(e^{x}\right) \bmod 1\right) + \color{blue}{\left(-1 \cdot x\right) \cdot \left(\left(e^{x}\right) \bmod 1\right)} \]

   4. neg-mul-1 6.1%

      \[\leadsto 1 \cdot \left(\left(e^{x}\right) \bmod 1\right) + \color{blue}{\left(-x\right)} \cdot \left(\left(e^{x}\right) \bmod 1\right) \]

   5. distribute-rgt-out 6.1%

      \[\leadsto \color{blue}{\left(\left(e^{x}\right) \bmod 1\right) \cdot \left(1 + \left(-x\right)\right)} \]

   6. sub-neg 6.1%

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

7. Simplified 6.1%

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

8. Final simplification 6.1%

   \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \cdot \left(1 - x\right) \]

Alternative 7: 5.2% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \left(\left(e^{x}\right) \bmod 1\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (fmod (exp x) 1.0))

C

double code(double x) {
	return fmod(exp(x), 1.0);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod(exp(x), 1.0d0)
end function

Python

def code(x):
	return math.fmod(math.exp(x), 1.0)

Julia

function code(x)
	return rem(exp(x), 1.0)
end

Wolfram

code[x_] := N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]

Derivation

1. Initial program 7.0%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Step-by-step derivation

   1. exp-neg 7.0%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\frac{1}{e^{x}}} \]

   2. associate-*r/ 7.0%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot 1}{e^{x}}} \]

   3. *-rgt-identity 7.0%

      \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}}{e^{x}} \]

3. Simplified 7.0%

   \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]

4. Taylor expanded in x around 0 6.7%

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

5. Taylor expanded in x around 0 5.7%

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

6. Final simplification 5.7%

   \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \]

Reproduce

herbie shell --seed 2023301 
(FPCore (x)
  :name "expfmod (used to be hard to sample)"
  :precision binary64
  (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))