Average Error: 0.1 → 0.1
Time: 20.3s
Precision: 64
\[0.0 \le e \le 1\]
\[\frac{e \cdot \sin v}{1 + e \cdot \cos v}\]
↓
\[e \cdot \frac{\sin v}{1 + e \cdot \cos v}\]
\frac{e \cdot \sin v}{1 + e \cdot \cos v}
↓
e \cdot \frac{\sin v}{1 + e \cdot \cos v}
double f(double e, double v) {
        double r20093 = e;
        double r20094 = v;
        double r20095 = sin(r20094);
        double r20096 = r20093 * r20095;
        double r20097 = 1.0;
        double r20098 = cos(r20094);
        double r20099 = r20093 * r20098;
        double r20100 = r20097 + r20099;
        double r20101 = r20096 / r20100;
        return r20101;
}
↓
double f(double e, double v) {
        double r20102 = e;
        double r20103 = v;
        double r20104 = sin(r20103);
        double r20105 = 1.0;
        double r20106 = cos(r20103);
        double r20107 = r20102 * r20106;
        double r20108 = r20105 + r20107;
        double r20109 = r20104 / r20108;
        double r20110 = r20102 * r20109;
        return r20110;
}

Error

Bits error versus e

Bits error versus v

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\frac{e \cdot \sin v}{1 + e \cdot \cos v}\]
  2. Using strategy rm

  3. Applied *-un-lft-identity0.1

    \[\leadsto \frac{e \cdot \sin v}{\color{blue}{1 \cdot \left(1 + e \cdot \cos v\right)}}\]

  4. Applied times-frac0.1

    \[\leadsto \color{blue}{\frac{e}{1} \cdot \frac{\sin v}{1 + e \cdot \cos v}}\]

  5. Simplified0.1

    \[\leadsto \color{blue}{e} \cdot \frac{\sin v}{1 + e \cdot \cos v}\]

  6. Final simplification0.1

    \[\leadsto e \cdot \frac{\sin v}{1 + e \cdot \cos v}\]

Reproduce

herbie shell --seed 2019303 
(FPCore (e v)
  :name "Trigonometry A"
  :precision binary64
  :pre (<= 0.0 e 1)
  (/ (* e (sin v)) (+ 1 (* e (cos v)))))