Solving a Recursive Sequence in Sequence App

11202014, 09:56 PM
Post: #1




Solving a Recursive Sequence in Sequence App
Hello. Can anyone tell me how I would solve a recursive sequence in the sequence app on the HP Prime? An example of what I am trying to solve is
U(1)=3 U(N)=2*U(n1)+3 

11202014, 10:40 PM
Post: #2




RE: Solving a Recursive Sequence in Sequence App
(11202014 09:56 PM)maxlockett619 Wrote: Hello. Can anyone tell me how I would solve a recursive sequence in the sequence app on the HP Prime? An example of what I am trying to solve iswhat do you mean by "solve" ? the sequence app is more to "study" sequences. did you try to type your formula in Symb screen ? U1(1)=3 U1(N)=2*U1(n1)+3 Patrice “Everything should be made as simple as possible, but no simpler.” Albert Einstein 

11202014, 11:33 PM
Post: #3




RE: Solving a Recursive Sequence in Sequence App  
11212014, 01:48 AM
Post: #4




RE: Solving a Recursive Sequence in Sequence App
Thanks for the replies. That solved my problems. In addition, do you know of any apps that you can download where you can input a sequence and be given a rule back? Thanks.


11212014, 06:49 AM
Post: #5




RE: Solving a Recursive Sequence in Sequence App
You can solve somes recurrences in CAS with the rsolve command.
[un]:=rsolve([u(n)=2*u(n1)+3,u(1)=3],u(n)); factor(un) 

11212014, 01:01 PM
Post: #6




RE: Solving a Recursive Sequence in Sequence App
(11212014 01:48 AM)maxlockett619 Wrote: Thanks for the replies. That solved my problems. In addition, do you know of any apps that you can download where you can input a sequence and be given a rule back? Thanks. I often "cheat" by looking it up in the Online Encyclopedia of Integer Sequences. Just type in a section of any sequence, and it identifies it, usually in both recursive and direct forms (jump down the page to the "FORMULA" section). Very cool, especially when the relationship between the recursive and direct formulae is utterly mysterious. Caution: Browsing OEIS is known to be addictive. <0ɸ0> Joe 

11212014, 10:52 PM
Post: #7




RE: Solving a Recursive Sequence in Sequence App
Quote:(…) where you can input a sequence and be given a rule back? For polynomial sequences you can apply the forward difference operator \(\Delta\) consecutively until you get just 0s. For the tetrahedral numbers we get: \[ \begin{matrix} U &: & {\color{Red} 0} & & 1 & & 4 & & 10 & & 20 & & 35 & & 56 & & \cdots \\ \Delta U &: & & {\color{Red} 1} & & 3 & & 6 & & 10 & & 15 & & 21 & & \cdots & \\ \Delta^2 U &: & & & {\color{Red} 2} & & 3 & & 4 & & 5 & & 6 & & \cdots & & \\ \Delta^3 U &: & & & & {\color{Red} 1} & & 1 & & 1 & & 1 & & \cdots & & & \\ \Delta^4 U &: & & & & & {\color{Red} 0} & & 0 & & 0 & & \cdots & & & & \\ \cdots &: & & & & & & & \cdots \end{matrix} \] Then use Newton's forward difference formula to write the sequence as a sum of binomial coefficients: \(U(n)=0\binom{n}{0}+1\binom{n}{1}+2\binom{n}{2}+1\binom{n}{3}\) Cheers Thomas 

11222014, 12:18 AM
Post: #8




RE: Solving a Recursive Sequence in Sequence App
Hey,
I know this is off topic, but are there GBA games for this just like how there are GBA games on the NSpire? (Pokemon, mainly) 

11222014, 02:41 PM
Post: #9




RE: Solving a Recursive Sequence in Sequence App
Nope, no GBA games on the Prime.
There are very few developers interested in lowlevel programming for the Prime, which is sad, as the Prime is an open platform, unlike the Nspire, and the Prime is powerful. Even though the Prime has half of the RAM of the '2011 Nspire CX, the Prime's processor is clocked three times higher, which makes the Prime the calculator with the least underpowered processor on the market. 

« Next Oldest  Next Newest »

User(s) browsing this thread: 1 Guest(s)