\frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a}\begin{array}{l}
\mathbf{if}\;b_2 \le -1.5396067403637575 \cdot 10^{153}:\\
\;\;\;\;\frac{1}{2} \cdot \frac{c}{b_2} - 2 \cdot \frac{b_2}{a}\\
\mathbf{elif}\;b_2 \le 2.5184045435465955 \cdot 10^{-179}:\\
\;\;\;\;\frac{1}{\frac{a}{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}}\\
\mathbf{elif}\;b_2 \le 2.5096626454411 \cdot 10^{56}:\\
\;\;\;\;\frac{\frac{0 + a \cdot c}{\left(-b_2\right) - \sqrt{b_2 \cdot b_2 - a \cdot c}}}{a}\\
\mathbf{else}:\\
\;\;\;\;\frac{-1}{2} \cdot \frac{c}{b_2}\\
\end{array}double code(double a, double b_2, double c) {
return ((-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a);
}
double code(double a, double b_2, double c) {
double VAR;
if ((b_2 <= -1.5396067403637575e+153)) {
VAR = ((0.5 * (c / b_2)) - (2.0 * (b_2 / a)));
} else {
double VAR_1;
if ((b_2 <= 2.5184045435465955e-179)) {
VAR_1 = (1.0 / (a / (sqrt(((b_2 * b_2) - (a * c))) - b_2)));
} else {
double VAR_2;
if ((b_2 <= 2.5096626454411205e+56)) {
VAR_2 = (((0.0 + (a * c)) / (-b_2 - sqrt(((b_2 * b_2) - (a * c))))) / a);
} else {
VAR_2 = (-0.5 * (c / b_2));
}
VAR_1 = VAR_2;
}
VAR = VAR_1;
}
return VAR;
}



Bits error versus a



Bits error versus b_2



Bits error versus c
Results
if b_2 < -1.5396067403637575e+153Initial program 63.1
Taylor expanded around -inf 2.3
if -1.5396067403637575e+153 < b_2 < 2.5184045435465955e-179Initial program 10.3
rmApplied clear-num10.4
Simplified10.4
if 2.5184045435465955e-179 < b_2 < 2.5096626454411205e+56Initial program 35.4
rmApplied flip-+35.4
Simplified17.1
if 2.5096626454411205e+56 < b_2 Initial program 57.5
Taylor expanded around inf 3.4
Final simplification8.9
herbie shell --seed 2020105
(FPCore (a b_2 c)
:name "quad2p (problem 3.2.1, positive)"
:precision binary64
(/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))