document.write( "Question 1041500: 3. Determine which of the following two rules (I or II) is an equivalent formulation of the recursive rule for Fibonacci numbers:\r
\n" ); document.write( "\n" ); document.write( "I) FN- 1 - FN = FN +1 , N > 1\r
\n" ); document.write( "\n" ); document.write( "II)FN +1 - FN = FN - 1 , N > 1
\n" ); document.write( " \n" ); document.write( "
Algebra.Com's Answer #656453 by Edwin McCravy(20054)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "You needed some parentheses in there to keep what \r\n" );
document.write( "you wrote readable.  \r\n" );
document.write( "\r\n" );
document.write( "So I will assume you meant this:\r\n" );
document.write( "\r\n" );
document.write( "I) F(N-1) -   F(N)    =    F(N+1),  N > 1\r\n" );
document.write( "\r\n" );
document.write( "II)F(N+1) -   F(N)    =    F(N-1),  N > 1\r\n" );
document.write( "\r\n" );
document.write( "The Fibonacci recursion formula says\r\n" );
document.write( "\r\n" );
document.write( "\"%28matrix%286%2C1%2C%0D%0AAny%2Cterm%2Cafter%2Cthe%2Csecond%2Cone%29%29\"\"%22%22=%22%22\"\"%28matrix%285%2C1%2C%0D%0AThe%2Cterm%2Cjust%2Cbefore%2Cit%29%29\"\"%22%22%2B%22%22\"\"%28matrix%289%2C1%2C%0D%0AThe%2Cterm%2Cjust%2Cbefore%2Cthe%2Cone%2Cjust%2Cbefore%2Cit%29%29\"\r\n" );
document.write( "

\n" ); document.write( "I) F(N-1) - F(N) = F(N+1)
\n" ); document.write( "
\r\n" );
document.write( "F(N-1) is the term just before F(N), which is the term just\r\n" );
document.write( "before F(N+1).\r\n" );
document.write( "\r\n" );
document.write( "...,F(N-1),F(N),F(N+1),...\r\n" );
document.write( "\r\n" );
document.write( "The correct formula should be F(N+1) = F(N-1) + F(N)\r\n" );
document.write( "\r\n" );
document.write( "But that one (I) has a minus where it should be a plus.  So that one \r\n" );
document.write( "is wrong.\r\n" );
document.write( "

\n" ); document.write( "II)F(N+1) - F(N) = F(N-1), N > 1
\n" ); document.write( "
\r\n" );
document.write( "This one is correct because if you solve for F(N+1),\r\n" );
document.write( "by adding F(N) to both sides, you get:\r\n" );
document.write( "\r\n" );
document.write( "             F(N+1) = F(N-1) + F(N)\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "
\n" );