series

Luis Pablo Michelena [email protected]
Wed, 15 Aug 2001 02:15:31 -0300


This is a multi-part message in MIME format.

------=_NextPart_000_00B0_01C12530.28D9B9E0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

hello, i just want to ask a simple question: does somebody have or know =
where to find a haskell program that calculates the number e, that is =
the list of infinite digits? Because i think it may be possible to do =
it, but i haven=B4t find the way to do it.
what i am looking for is something like the ertostenes sifts, that =
prints every prime number until it run out of memory...
thank you,
                Luis

------=_NextPart_000_00B0_01C12530.28D9B9E0
Content-Type: text/html;
	charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=3D"text/html; charset=3Diso-8859-1" =
http-equiv=3DContent-Type>
<META content=3D"MSHTML 5.00.2314.1000" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT size=3D2>hello, i just want to ask a simple question: does=20
somebody&nbsp;have or know where to find a haskell program that =
calculates the=20
number e, that is the list of&nbsp;infinite digits? Because i think it =
may be=20
possible to do it, but i&nbsp;haven=B4t find the way to do =
it.</FONT></DIV>
<DIV><FONT size=3D2>what i am looking for is something like&nbsp;the =
ertostenes=20
sifts, that prints every prime number until it run out of =
memory...</FONT></DIV>
<DIV><FONT size=3D2>thank you,</FONT></DIV>
<DIV><FONT size=3D2>&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; =
&nbsp;&nbsp;&nbsp;=20
&nbsp;&nbsp;&nbsp; Luis</FONT></DIV></BODY></HTML>

------=_NextPart_000_00B0_01C12530.28D9B9E0--