A long story on a naughty boy please​

Write a recursive sequence that represents the sequence defined by the following explicit formula:

(least common multiples) the answer that i had in the 1st step was lcm of airline tickets sold=72. idk if that even matters but just in case. ! three co-workers are busy selling airline tickets over the phone. in an 8-hour day, charles can sell 8 airline tickets, ann can sell 9 airline tickets, and michelle can sell 6 airline tickets. step 2 of 2: what is the smallest number of 8-hour days needed for each of them to achieve the same number of sales? it takes charles . it takes . it takes .

Abag contains 3 red marbles, 2 blue marbles, and 2 green marbles. one marble is picked, then another marble. assume that the selections are made with replacement. a) find the probability of picking two red marbles with replacement. b) find the probability of picking a red marble and a blue marble. assume the selections are made without replacement. c) find the probability of picking two red marbles without replacement. d) find the probability of picking a red marble and a blue marble without replacement.