LF: PRIME NUMBERS!

To: list-fargo@lists.ticalc.org
Subject: LF: PRIME NUMBERS!
From: "Kevin T. Huber" <khuber@MR.Net>
Date: Wed, 11 Dec 1996 23:45:05 GMT
In-Reply-To: <19961211.200031.6902.0.that1guy@juno.com>
References: <19961211.200031.6902.0.that1guy@juno.com>
Reply-To: list-fargo@lists.ticalc.org

The built in function factor essentially does this.  

i.e.
input "enter a number",n
if instring(string(factor(n)),"*") then
   disp "not a prime"
else
   disp "prime"
endif

I'm not sure what the usefulness of iterating through the prime numbers is,
although even a ti-basic version of the sieve of erastothenes shouldn't be
all that slow.

-Kevin
khuber@mr.net

that1guy@juno.com writes:
 > 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.

References:

LF: PRIME NUMBERS!

From: that1guy@juno.com

Prev: LF: Fargo/M68k assembly resources
Next: Re: LF: How to get the newst ROM version.
Index(es):
- Main
- Thread