I run a book club with $n$ people, not including myself. Every day, for $365$ days, I invite five members in the club to review a book. What is the smallest positive integer $n$ so that I can avoid ever having the exact same group of five members over all $365$ days?

Time (minutes) amount of water (gallons) practice 1. jin fills up a 510-gallon pool in the backyard for her children. she fills it with the garden hose at a rate of 17 gallons per minute. after it is filled, she lets it sit for 30 minutes in order to let the water temperature rise. the children then get in and have fun for an hour. the pool loses about 5 gallon of water each minute due to their splashing and playing. at the end of the hour, they tear the pool while getting out, which causes a leak the pool then begins to lose water at a rate of 2 gallons per minute. a. complete the table to show the amount of water in the pool after each minute. b. create a graph to model the problem situation. include when the pool will be empty. c. write a piecewise function that models this problem situation. explain your reasoning for each piece of the function. d. identify the x- and y-intercept. explain what they mean in terms of the problem situation, atamantha a cul 80 100 120 150 200 ning, inc