.
.
.
.
.
.
Computes a mantissa of precision p, the corresponding exponent,
and the position with respect to the real quotient of the
input floating-point numbers.
The algorithm performs the following steps:
-
Shift dividend mantissa so that it has at least p2 + p digits.
-
Perform the Euclidean division.
-
Compute the position according to the division remainder.
Complexity is fine as long as p1 <= 2p and p2 <= p.
.
Proof.
.