Average Error: 30.6 → 0.4
Time: 18.6s
Precision: 64
Internal Precision: 576
\[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right) \cdot \log base + \tan^{-1}_* \frac{im}{re} \cdot 0}{\log base \cdot \log base + 0 \cdot 0}\]
↓
\[\frac{1}{\frac{\log base}{\log \left(\sqrt{re^2 + im^2}^*\right)}}\]

Error

Bits error versus re

Bits error versus im

Bits error versus base

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 30.6

    \[\frac{\log \left(\sqrt{re \cdot re + im \cdot im}\right) \cdot \log base + \tan^{-1}_* \frac{im}{re} \cdot 0}{\log base \cdot \log base + 0 \cdot 0}\]

  2. Initial simplification0.4

    \[\leadsto \frac{\log \left(\sqrt{re^2 + im^2}^*\right)}{\log base}\]
  3. Using strategy rm

  4. Applied clear-num0.4

    \[\leadsto \color{blue}{\frac{1}{\frac{\log base}{\log \left(\sqrt{re^2 + im^2}^*\right)}}}\]
  5. Using strategy rm

  6. Applied pow10.4

    \[\leadsto \frac{1}{\frac{\log base}{\log \color{blue}{\left({\left(\sqrt{re^2 + im^2}^*\right)}^{1}\right)}}}\]

  7. Applied log-pow0.4

    \[\leadsto \frac{1}{\frac{\log base}{\color{blue}{1 \cdot \log \left(\sqrt{re^2 + im^2}^*\right)}}}\]

  8. Applied *-un-lft-identity0.4

    \[\leadsto \frac{1}{\frac{\color{blue}{1 \cdot \log base}}{1 \cdot \log \left(\sqrt{re^2 + im^2}^*\right)}}\]

  9. Applied times-frac0.4

    \[\leadsto \frac{1}{\color{blue}{\frac{1}{1} \cdot \frac{\log base}{\log \left(\sqrt{re^2 + im^2}^*\right)}}}\]

  10. Simplified0.4

    \[\leadsto \frac{1}{\color{blue}{1} \cdot \frac{\log base}{\log \left(\sqrt{re^2 + im^2}^*\right)}}\]

  11. Final simplification0.4

    \[\leadsto \frac{1}{\frac{\log base}{\log \left(\sqrt{re^2 + im^2}^*\right)}}\]

Runtime

Time bar (total: 18.6s)Debug logProfile

herbie shell --seed 2018257 +o rules:numerics
(FPCore (re im base)
  :name "math.log/2 on complex, real part"
  (/ (+ (* (log (sqrt (+ (* re re) (* im im)))) (log base)) (* (atan2 im re) 0)) (+ (* (log base) (log base)) (* 0 0))))