Average Error: 32.2 → 32.2
Time: 1.0s
Precision: binary64
Cost: 19776
\[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10}\]
↓
\[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10}\]
\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10}
↓
\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10}
(FPCore (re im)
 :precision binary64
 (/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))
↓
(FPCore (re im)
 :precision binary64
 (/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))
double code(double re, double im) {
	return log(sqrt((re * re) + (im * im))) / log(10.0);
}
↓
double code(double re, double im) {
	return log(sqrt((re * re) + (im * im))) / log(10.0);
}

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 32.2

    \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right)}{\log 10}\]

Reproduce

herbie shell --seed 2021044 
(FPCore (re im)
  :name "math.log10 on complex, real part"
  :precision binary64
  (/ (log (sqrt (+ (* re re) (* im im)))) (log 10.0)))