document.write( "Question 583415: Can you help me figure out what the formula is in this pattern: 8,24,72,216 ? Example of formula:3n-3 N=the position of the number \n" ); document.write( "
Algebra.Com's Answer #372637 by KMST(5328)![]() ![]() You can put this solution on YOUR website! There are two special sequence patterns that are studies in algebra: \n" ); document.write( "arithmetic sequences (called arithmetic progressions in other countries) and \n" ); document.write( "geometric sequences (called geometric progressions in other countries). \n" ); document.write( "In an arithmetic sequence each number (we call them terms) is the one before plus a constant that we call the common difference. To find out if a sequence is an arithmetic sequence, we calculate the differences between consecutive terms. In this case, we calculate: \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "In a geometric sequence, each term is equal to the previous number times a constant that we call the common ratio. To find out if a sequence is a geometric sequence, we calculate the ratios of consecutive terms. In this case, we calculate: \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "The ratio is always 3. There is a common ratio and it's 3. It is a geometric sequence. We call the nth term \n" ); document.write( " \n" ); document.write( "That's what we call a recursive formula. \n" ); document.write( "We also know that, calling the first tern \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "We can do the formal proof by induction, if needed, but \n" ); document.write( "In your case, \n" ); document.write( " \n" ); document.write( " |