... all n ≥ 1, 1 2F 1/ Fnn+ L 1/ Lnn≤ 2 −Fn +1 F2n.(The Fibonacci and Lucas numbers are given by the recurrence an +1 = an+an 1 , withF0= 0, F 1 = 1, L0= 2andL 1 = 1. ) 11 340. Proposed ... fora = 1orx = 1. If f (x) =nj =1 (1 − xaj) for 0 ≤ x ≤ 1, then0 ≤ f (x) ≤ (1 − xa 1 ) (1 − xa2) ≤ a 1 a2 (1 − x)2.Hence f (x)< ;1 − x as x approaches 1 −. On the other hand, 1 ≥ ... C)=(sin A)2(sin B)2(sin C)2 (1 − cos A) (1 − cos B) (1 − cos C)= (1 − cos2A) (1 − cos2B) (1 − cos2C) (1 − cos A) (1 − cos B) (1 − cos C)= (1 + cos A) (1 +cos B) (1 +cos C) ≤3 + cos A + cos...