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

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.2

    \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m\]
  2. Using strategy rm

  3. Applied *-un-lft-identity_binary640.2

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

  4. Applied times-frac_binary640.2

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

  5. Simplified0.2

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

  6. Final simplification0.2

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

Reproduce

herbie shell --seed 2020220 
(FPCore (m v)
  :name "a 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) m))