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.

The spotter on the ground is standing beneath the safety net. what is his distance from the base of the platform, to the nearest meter? 3 meters, 2 meters, 4 meters, 1 meter?

How to determine whether two known pairs of points are on the same line.

Svetlana's hair is 4 4 centimeters ( cm cm) long. her hair grows 1 . 5 cm 1.5cm per month. svetlana wants her hair to be less than 1 6 cm 16cm long. write an inequality to determine the number of months, m m, svetlana can allow her hair to grow so that it is less than 1 6 cm 16cm long.