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.

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

Angela took a general public aptitude test and scored in the 88th percentile for aptitude in accounting. what percentage of the scores were at or below her score?

Write the equations in logarithmic form 9^4=6,561