The lucas numbers satisfy the recurrence relation ln = ln−1 + ln−2, and the initial conditions l0 = 2 and l1 = 1. a) show that ln = fn−1 + fn+1 for n = 2, where fn is the nth fibonacci number. b) find an explicit formula for the lucas numbers.

Choose a second initial value that is 0.01 greater than the initial value from question 9. iterate it using the function, f, ten times. if necessary, you can round your results to the nearest ten-thousandth.

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

Bob is putting books on a shelf and takes a break after filling 18 1/2 inches on the book shelf. the book shelf is now 2/3 full. how long is the entire bookshelf?