Find(*()*) First write out the summation: Find the answer: Find the largest value of n such that: " (6k - 4) < 3500 k=1 n 5 A Super Happy Fun Ball is dropped from a height of 16 feet and rebounds of the distance from which it fell. How many times will it bounce before its rebound is less than 1 foot? It will bounce times before its rebound is less than 1 foot. How far will the ball travel before it comes to rest on the ground? It will travel feet before it comes to rest on the ground. Suppose a designer has a palette of 8 colors to work with, and wants to design a flag with 2 vertical stripes, all of different colors. How many possible flags can be created? Nahele bought 13 plants to arrange along the border of his garden. How many distinct arrangements can he make if the plants are comprised of 5 tulips, 4 roses, and 4 daisies?