*36 Prove an analogue of the formula of Problem 35 for the Lucas numbers.
| PREVIOUS PAGE | COVER PAGE | TABLE OF CONTENTS | INDEX | ANSWERS TO ODD NUMBERED PROBLEMS | NEXT PAGE |
34. For the sequence defined in Problem 33, prove that Sn is the Fibonacci number Fn+1.
*35. Prove the following property of the Fibonacci numbers:
*36 Prove an analogue of the formula of Problem 35 for the
Lucas numbers.
37 Find a compact expression, without using the sigma notation, for
that is, for 
| PREVIOUS PAGE | COVER PAGE | TABLE OF CONTENTS | INDEX | ANSWERS TO ODD NUMBERED PROBLEMS | NEXT PAGE |
Monday, June 8, 1998