Re: LF: PRIME NUMBERS!

To: list-fargo@lists.ticalc.org
Subject: Re: LF: PRIME NUMBERS!
From: "Kevin T. Huber" <khuber@MR.Net>
Date: Fri, 13 Dec 1996 07:45:47 GMT
In-Reply-To: <Pine.GSO.3.95.961212171856.8556B-100000@rhf.bradley.edu>
References: <199612121522.PAA06855@spam.mr.net> <Pine.GSO.3.95.961212171856.8556B-100000@rhf.bradley.edu>
Reply-To: list-fargo@lists.ticalc.org

Jonathan Dickmann writes:
 > sorry, you lose.  pay a little bit better attention to what you're talking
 > about next time you critique someone's code.  I don't enjoy material I
 > present being called worthless by someone that can't interpret code
 > correctly.

Fair enough, I didn't look at it very closely since I'm not used to
ti-basic syntax.  It's still the most naive implementation of a prime
number factorization routine you can have so it was on that basis I was
being negative.  I should have stated that clearly -- your implementation
does appear correct.

-Kevin
khuber@mr.net

References:

Re: LF: PRIME NUMBERS!

From: "Kevin T. Huber" <khuber@MR.Net>

Re: LF: PRIME NUMBERS!

From: Jonathan Dickmann <jdickman@rhf.bradley.edu>

Prev: LF: THANKS
Next: LF: On-calc assembler
Index(es):
- Main
- Thread