Use mathematical Induction to show that for n >= 1,
Fn < 2^n
Where Fn is a Fibinocci number.
27
Feb
Fibinocci Number Proof
posted by admin in Uncategorized and have No Comments
Archives
-
Recent Posts
- Final theory of everything V2.0
- Computability and logic
- Final Theory Of Everything V4.0
- Final Theory Of Everything V5.0
- SUBTLETY AND BEAUTY IN EINSTEIN'S CRIMINAL CULT
- Rambus2005@yahoo.com put angle (phi) 89 in the your equation (1.5) ,
- Task
- Question about Frege's Theorem
- Nameless, Rambus2005@yahoo.com put angle (phi) 89 in the your equation (1.5), then I will clear other doubts.
- "Nonstandard" Turing-Machines?
Place your comment
You must be logged in to post a comment.