Re: LF: PRIME NUMBERS!
[Prev][Next][Index][Thread]
Re: LF: PRIME NUMBERS!
that1guy@juno.com wrote:
>
> Could someone PLEASE write a Prime-Number finder for Fargo... Nothing
> fancy at all, just something that will handle big numbers. I wrote one
> for ti-basic, but it goes SO SLOW! I think this would be perfect for ASM
> becuase it goes so fast.
Not really that necessary since FACTOR( handles very big numbers, but it
could be cool to see how much faster I/someone else could make it :-)
--
Jimmy Mårdell "To tell you the truth I'm so damned tired
mailto:mja@algonet.se A life-long leave is what I require
http://www.algonet.se/~mja Rules, regulations try to form us
IRC: Yarin But not me, I'm gonna be enormous" /CRD
Follow-Ups:
References: