<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body>
<p><font face="serif">Class -- one question I keep getting relates
to the largest integer to be input into your Goldbach weak
conjecture algorithm. To make this simple lets keep it to the
maximum size of a signed integer in gcc on cobra --
2147483647. That should make it also work without too much
difficulty across all of the other programming languages we will
be using.</font></p>
<p><font face="serif">I know that there are 105097566 prime numbers
- and some of you are focusing on the "worst possible base" of
having a huge number as input. My recommendation is to not do
that. Get code working for small cases and then you can focus
on improving it for larger values.</font></p>
<p><font face="serif"></font><br>
</p>
<pre class="moz-signature" cols="72">--
Andrew J. Pounds, Ph.D. (<a class="moz-txt-link-abbreviated" href="mailto:pounds_aj@mercer.edu">pounds_aj@mercer.edu</a>)
Professor of Chemistry and Computer Science
Director of the Computational Science Program
Mercer University, Macon, GA 31207 (478) 301-5627
</pre>
</body>
</html>