Average Error: 0.4 → 0.4
Time: 23.9s
Precision: 64
Internal Precision: 576
\[\frac{\left(2 \cdot N\right) \cdot \log f}{\log 2}\]
\[\left(\log f \cdot \left(2 \cdot N\right)\right) \cdot \frac{1}{\log 2}\]

Error

Bits error versus N

Bits error versus f

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.4

    \[\frac{\left(2 \cdot N\right) \cdot \log f}{\log 2}\]
  2. Using strategy rm
  3. Applied div-inv0.4

    \[\leadsto \color{blue}{\left(\left(2 \cdot N\right) \cdot \log f\right) \cdot \frac{1}{\log 2}}\]
  4. Final simplification0.4

    \[\leadsto \left(\log f \cdot \left(2 \cdot N\right)\right) \cdot \frac{1}{\log 2}\]

Runtime

Time bar (total: 23.9s)Debug log

herbie shell --seed '#(2775764126 3555076145 3898259844 1891440260 2599947619 1948460636)' 
(FPCore (N f)
  :name "2*N*log(f)/log(2)"
  (/ (* (* 2 N) (log f)) (log 2)))