Re: TI Programming, CRYPTO!

Re: TI Programming, CRYPTO!

• To: CALC-TI@LISTS.PPP.TI.COM
• Subject: Re: TI Programming, CRYPTO!
• From: CalFolds <calfolds@AOL.COM>
• Date: Sun, 15 Mar 1998 23:21:11 GMT
• Organization: AOL http://www.aol.com
• References: <35030D52.6D71A90A@erols.com>
• Reply-To: CalFolds <calfolds@AOL.COM>
• Xref: paladin.american.edu bit.listserv.calc-ti:21641

There is a way that I haven't compleatly thought out yet,  It is very complex
and large, and must importantly I think it would be way to slow.  I'll see what
I can if you send me all the rules (Email please I don't check this newsgroup
often) like can the problem have parenteses and what functions does it use
(i.e.  +, -, /, *, ^) can there be extra numbers like this :   1 2 3 4 5 = 60
 (1*4)+(2*4)+(3*4)+(4*4)+(5*4) = 60.    If it does you may as well not even try
it would take years on a pentium (not literally  :) to do all of that.

• Re: TI Programming, CRYPTO!
• From: Tim Brierley <Brierley@EROLS.COM>

• Prev: Re: Sound on the 92
• Next: Re: Pi
• Index(es):
  • Main
  • Thread