🚀 go-pugleaf

In article <1993Apr14.012931.18751@ast.saic.com>, hilljr@jupiter.saic.com (Jay R. Hill) writes:
|> In article <1993Apr12.230442.6292@ast.saic.com>, hilljr@jupiter.saic.com (Jay R. Hill) writes:
|> ...
|> |> 
|> |> Yuval and I have modified the GIPPP program so it now
|> |> computes an upper and lower limit to the MSet area.
...
|> The program is nearly ready. The complete source will be 
...
   I'm sorry for the delay. Yuval has had a tough week, the 
flu has attacked his family fll blast.

|>   I'm looking foreward to you on the net to join
|> us in this calculation.

   Thank you for the responses you on the net have already. 
A number of you have already EMailed to me your interest in this
calculation. We are talking real computing capability at a
number of sites.  As more of you let me know what you are willing 
to do, I can better scale how deep this calculation can go. 
Unfortionately, I have not figured out how we can restart
and use an earlier result. That is if we decide on 18 bisections
and find it takes only 100 hours total, well then we start over
with depth 22. The first is just an excersize.  The responses
I'm getting will allow Yuval and I to set a good scale for the
project.  I figure a test at that level will confirm it. Then
we start.  Early next week, I hope.

Thank you for your support.

Warmly,
Jay Hill
-- 
{ hilljr@jupiter.saic.com } begin writeln(3*ln(640320)/sqrt(163):17:15) end.
void main(){double sqrt(), y=1/sqrt(2.), a=.5, m=1,z; int n=0;
for(;m*=2,z=sqrt(1-y*y),y=(1-z)/(1+z),a=a*(1+y)*(1+y)-m*y,n<3;n++);
printf("17.15lf\n",1/a);}