document.write( "Question 195095: 4. On October 1, a gardener plants 20 bulbs. On October 2, she plants 23
\n" ); document.write( "bulbs. On October 3, she plants 26 bulbs. She continues in this pattern
\n" ); document.write( "until October 15, on which she plants the last bulbs.\r
\n" ); document.write( "\n" ); document.write( "a. Write an explicit formula to model the number of bulbs she plants
\n" ); document.write( "each day.
\n" ); document.write( "b. Write a recursive formula to model the number of bulbs she plants
\n" ); document.write( "each day.
\n" ); document.write( "c. How many bulbs will the gardener plant on October 15?
\n" ); document.write( "d. What is the total number of bulbs she plants from October 1 to
\n" ); document.write( "October 15, inclusive?
\n" ); document.write( "

Algebra.Com's Answer #146350 by RAY100(1637)\"\" \"About 
You can put this solution on YOUR website!
a(n) =a(1) + (n-1) d,,,,where a(n) = nth entry,,n=no entries,,d = difference between entries
\n" ); document.write( ".
\n" ); document.write( "a(15) = 20 + (15-1) 3 = 20 + 42 = 62
\n" ); document.write( ".
\n" ); document.write( "recursive, a(n) = a (n-1) +d
\n" ); document.write( ".
\n" ); document.write( "sum = n(a(1) +a(n) ) /2= 15 *( 20 +62)/2 = 615
\n" ); document.write( ".
\n" ); document.write( "
\n" );