Re: need help evaluating a recursuive sequence on ti 86!!!!!!!!

Re: need help evaluating a recursuive sequence on ti 86!!!!!!!!

• To: CALC-TI@LISTS.PPP.TI.COM
• Subject: Re: need help evaluating a recursuive sequence on ti 86!!!!!!!!
• From: Tom Lake <tomlake@SLIC.COM>
• Date: Sat, 19 Dec 1998 12:27:22 -0500
• Organization: St. Lawrence Internet Connection
• References: <367b19b8.20616889@news1.qc.sympatico.ca> <19981219121709.07206.00001255@ng-fd2.aol.com>
• Reply-To: Tom Lake <tomlake@SLIC.COM>
• Xref: paladin.american.edu bit.listserv.calc-ti:26981

>I don't know what a "recursive" sequence is, even in math. Perhaps you mean
>iterative. Sequences are iterative if the next value depends on the
previous
>values. Iterations are easy to do, and FAST on the 85. KX(1-X) in
particular is
>superfast.

Recursion is a term used in programming.  It's the technique whereby a
routine calls itself to solve a problem.  A classic example is the
calculation of a factorial. You can have the factorial routine call itself
with sucessively smaller numbers until it reaches 1.

Tom Lake

• Re: need help evaluating a recursuive sequence on ti 86!!!!!!!!
• From: Kasper Vibe Grevsen <removekaspervg@POST6.TELE.DK>

• Re: need help evaluating a recursuive sequence on ti 86!!!!!!!!
• From: Benoit Morrissette <bmorrissNOSPAM@SYMPATICO.CA>
• Re: need help evaluating a recursuive sequence on ti 86!!!!!!!!
• From: STL137 <stl137@AOL.COM>

• Prev: Re: need help evaluating a recursuive sequence on ti 86!!!!!!!!
• Next: problems w/ $4 ser. ti-82 link.... help?!
• Index(es):
  • Main
  • Thread