[Date Index] [Thread Index] [Author Index]

Re: Replace in recursive equations

• To: mathgroup at smc.vnet.net
• Subject: [mg54372] Re: Replace in recursive equations
• From: highegg at centrum.cz (highegg)
• Date: Sat, 19 Feb 2005 02:32:35 -0500 (EST)
• References: <7ly23jyhsc2l@legacy>
• Sender: owner-wri-mathgroup at wolfram.com

On 18 Feb 05 12:22:53 -0500 (EST), 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. 


just use 
(your equation) /. F[expr_]->FF[expr]+Q
regards, 
highegg