document.write( "Question 1179386: Write a recursive rule that describes the pattern in the total number of dots.\r
\n" ); document.write( "\n" ); document.write( "x|1|2|3|4|5|6|
\n" ); document.write( "________________
\n" ); document.write( "y|1|3|6|10|15|21 \n" ); document.write( "

Algebra.Com's Answer #808928 by ikleyn(52803) $\"\"$ $\"About$

You can put this solution on YOUR website!
.
\n" ); document.write( "

\r\n" );
document.write( "\r\n" );
document.write( "     = 1;    -  = n,   n = 2, 3, 4, . . . ,\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "or, which is the same,\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "     = 1;    =  + n,   n = 2, 3, 4, . . . \r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "It is the recursive formula the problem requests for.\r\n" );
document.write( "

\r
\n" ); document.write( "\n" ); document.write( "Solved, answered and explained.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "

\n" );