document.write( "Question 777509: A playground is being designed where children can interact with their friends in certain combinations.
\n" );
document.write( "If there is 1 child, there can be 0 interactions.
\n" );
document.write( "If there are 2 children, there can be only 1 interaction.
\n" );
document.write( "If there are 3 children, there can be 5 interactions.
\n" );
document.write( "If there are 4 children, there can be 14 interactions.
\n" );
document.write( "Which recursive equation represents the pattern?\r
\n" );
document.write( "\n" );
document.write( "a. an = an - 1 + 2(n - 1) \r
\n" );
document.write( "\n" );
document.write( "b. an = an - 1 + (n - 1) 2 \r
\n" );
document.write( "\n" );
document.write( "c. an = an - 1 + 2(n - 1) \r
\n" );
document.write( "\n" );
document.write( "d. an = an - 1 + (2n - 1) \r
\n" );
document.write( "\n" );
document.write( "I want to know the proccess on how to do this not only the answer. \n" );
document.write( "
Algebra.Com's Answer #474123 by stanbon(75887)![]() ![]() ![]() You can put this solution on YOUR website! A playground is being designed where children can interact with their friends in certain combinations. \n" ); document.write( "If there is 1 child, there can be 0 interactions. \n" ); document.write( "If there are 2 children, there can be only 1 interaction. \n" ); document.write( "If there are 3 children, there can be 5 interactions. \n" ); document.write( "If there are 4 children, there can be 14 interactions. \n" ); document.write( "Which recursive equation represents the pattern? \n" ); document.write( "Note: There is no magic to finding the answer. You just have \n" ); document.write( "to test each one to see what does and what does not give the answer. \n" ); document.write( "------------------------------ \n" ); document.write( "a. an = a(n - 1) + 2(n - 1) \n" ); document.write( "a1 = 0 + 2*0 \n" ); document.write( "a2 = 0 + 2*1 = 2 fails at a2 \n" ); document.write( "-------------------------------------- \n" ); document.write( "b. an = a(n - 1) + (n - 1)^2 \n" ); document.write( "a1 = 0 + 0^2 = 0 \n" ); document.write( "a2 = 0 + 1^2 = 1 \n" ); document.write( "a3 = 1 + 2^2 = 5 \n" ); document.write( "a4 = 3 + 3^2 = 12 fails at a4 \n" ); document.write( "-------------------------------------- \n" ); document.write( "etc... \n" ); document.write( "Cheers, \n" ); document.write( "Stan H. \n" ); document.write( "c. an = a(n - 1) + 2(n - 1) \n" ); document.write( "d. an = a(n - 1) + (2n - 1) \n" ); document.write( " \n" ); document.write( " |