Replace in recursive equations

*To*: mathgroup at smc.vnet.net*Subject*: [mg54371] Replace in recursive equations*From*: skirmantas.janusonis at yale.edu (Skirmantas)*Date*: Sat, 19 Feb 2005 02:32:32 -0500 (EST)*Sender*: owner-wri-mathgroup at wolfram.com

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.

**Follow-Ups**:**Re: Replace in recursive equations***From:*Andrzej Kozlowski <akoz@mimuw.edu.pl>