Re: Replace in recursive equations
- To: mathgroup at smc.vnet.net
- Subject: [mg54389] Re: [mg54371] Replace in recursive equations
- From: Andrzej Kozlowski <akoz at mimuw.edu.pl>
- Date: Sun, 20 Feb 2005 00:07:48 -0500 (EST)
- References: <200502190732.CAA06119@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
On 19 Feb 2005, at 08:32, Skirmantas wrote: > The last sentence of my previous message about Inverse got somehow > scrambled. I meant "I have to re-input the output to get the result." > > One more quick question. Suppose I have a recursive equation F[n+1]==a > F[n]. I want to replace F[n]->FF[n]+Q for _all_ n's. Q is a constant. > What is the best way to do it? The left side should become FF[n+1]+Q > and the right a(FF[n]+Q). Any help would be appreciated. > > > F[n + 1] == a*F[n] /. F[x_] -> FF[x] + Q Q + FF[n + 1] == a*(Q + FF[n]) Andrzej Kozlowski Chiba, Japan http://www.akikoz.net/andrzej/index.html http://www.mimuw.edu.pl/~akoz/
- References:
- Replace in recursive equations
- From: skirmantas.janusonis@yale.edu (Skirmantas)
- Replace in recursive equations