Recurrence relations
(1) find a recurrence relation for the number length n bit strings that start and end in 1 (where n > = 2)
(2) use this recurrence relation to find the number of permutations of a set with n elements using the expansion method.

Matt had 5 library books. he checked out 1 additional book every week without retuening any books. whats the matching equation

Written as a simplified polynomial in standard form, what is the result when (2x+8)^2(2x+8) 2 is subtracted from 8x^2-38x 2 −3?

The stem-and-leaf plot shows the heights in centimeters of teddy bear sunflowers grown in two different types of soil. soil a soil b 5 9 5 2 1 1 6 3 9 5 1 0 7 0 2 3 6 7 8 2 1 8 3 0 9 key: 9|6 means 69 key: 5|8 means 58 calculate the mean of each data set. calculate the mean absolute deviation (mad) of each data set. which set is more variable? how do you know?