Solve both problems pls brainliest

Asequence {an} is defined recursively, with a1 = 1, a2 = 2 and, for n > 2, an = an-1 an-2 . find the term a241. a) 0 b) 1 c) 2 d) 1 2

During a bike challenge riders have to collect various colored ribbons each 1/2 mile they collect a red ribbon each eighth mile they collect a green ribbon and each quarter mile they collect a blue ribbion wich colors of ribion will be collected at the 3/4 markrer

(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 .