Average Error: 0.0 → 0.0
Time: 4.0s
Precision: binary64
\[e^{re} \cdot \cos im \]
↓
\[e^{re} \cdot \cos im \]
(FPCore (re im) :precision binary64 (* (exp re) (cos im)))
↓
(FPCore (re im) :precision binary64 (* (exp re) (cos im)))
double code(double re, double im) {
	return exp(re) * cos(im);
}
↓
double code(double re, double im) {
	return exp(re) * cos(im);
}

real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * cos(im)
end function
↓
real(8) function code(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * cos(im)
end function

public static double code(double re, double im) {
	return Math.exp(re) * Math.cos(im);
}
↓
public static double code(double re, double im) {
	return Math.exp(re) * Math.cos(im);
}

def code(re, im):
	return math.exp(re) * math.cos(im)
↓
def code(re, im):
	return math.exp(re) * math.cos(im)

function code(re, im)
	return Float64(exp(re) * cos(im))
end
↓
function code(re, im)
	return Float64(exp(re) * cos(im))
end

function tmp = code(re, im)
	tmp = exp(re) * cos(im);
end
↓
function tmp = code(re, im)
	tmp = exp(re) * cos(im);
end

code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]
↓
code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Cos[im], $MachinePrecision]), $MachinePrecision]

e^{re} \cdot \cos im
↓
e^{re} \cdot \cos im

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{re} \cdot \cos im \]

  2. Final simplification0.0

    \[\leadsto e^{re} \cdot \cos im \]

Reproduce

herbie shell --seed 2022150 
(FPCore (re im)
  :name "math.exp on complex, real part"
  :precision binary64
  (* (exp re) (cos im)))