Average Error: 0.1 → 0.1
Time: 6.8s
Precision: binary64
\[0 < m \land 0 < v \land v < 0.25\]
\[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)\]
↓
\[\left(\left(\frac{m}{v} - m \cdot \frac{m}{v}\right) - 1\right) \cdot \left(1 - m\right)\]
\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)
↓
\left(\left(\frac{m}{v} - m \cdot \frac{m}{v}\right) - 1\right) \cdot \left(1 - m\right)
(FPCore (m v) :precision binary64 (* (- (/ (* m (- 1.0 m)) v) 1.0) (- 1.0 m)))
↓
(FPCore (m v)
 :precision binary64
 (* (- (- (/ m v) (* m (/ m v))) 1.0) (- 1.0 m)))
double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
}
↓
double code(double m, double v) {
	return (((m / v) - (m * (m / v))) - 1.0) * (1.0 - m);
}

Error

Bits error versus m

Bits error versus v

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)\]

  2. Taylor expanded around 0 0.1

    \[\leadsto \left(\color{blue}{\left(\frac{m}{v} - \frac{{m}^{2}}{v}\right)} - 1\right) \cdot \left(1 - m\right)\]

  3. Simplified0.1

    \[\leadsto \left(\color{blue}{\left(\frac{m}{v} - \frac{m}{v} \cdot m\right)} - 1\right) \cdot \left(1 - m\right)\]

  4. Final simplification0.1

    \[\leadsto \left(\left(\frac{m}{v} - m \cdot \frac{m}{v}\right) - 1\right) \cdot \left(1 - m\right)\]

Reproduce

herbie shell --seed 2020231 
(FPCore (m v)
  :name "b parameter of renormalized beta distribution"
  :precision binary64
  :pre (and (< 0.0 m) (< 0.0 v) (< v 0.25))
  (* (- (/ (* m (- 1.0 m)) v) 1.0) (- 1.0 m)))