<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=us-ascii">
<META NAME="Generator" CONTENT="MS Exchange Server version 6.5.7652.24">
<TITLE>fast determination of sign of sum</TITLE>
</HEAD>
<BODY>
<!-- Converted from text/rtf format -->
<P><FONT FACE="Arial">I would be grateful for suggestions on these questions:</FONT>
</P>
<P><FONT FACE="Arial">1. Given two large mpz_t (say, of order 2^1000000), what is the best way to determine the sign of their sum? Is it better just to add them, or to do several comparisons and sign tests?</FONT></P>
<P><FONT FACE="Arial">2. If it is better not to add them, is it still better to use the comparison and sign test method recursively to determine the sign of the sum of more than two integers? (In my actual application, there are four.)</FONT></P>
<P><FONT FACE="Arial">Thanks,</FONT>
<BR><FONT FACE="Arial">Keith</FONT>
</P>
<BR>
</BODY>
</HTML>