
Theory of Computation Theoretical Computer Science  Automata Theory, Computability Theory, and Computational Complexity Theory 
 LinkBack  Thread Tools  Display Modes 
September 13th, 2012, 09:44 AM  #1 
Joined: Sep 2012 Posts: 1  Fibonacci function Fn = Fn1 + Fn2 n>2, f1=1, f2=1?
consider the Fibonacci function Fn = Fn1 + Fn2 n>2, f1=1, f2=1 Proof the following: 1. For every n > 1 F3n is even. 2. For every n > 1 F4n is divisible by 3. 
My Computer Forum is free to register and we welcome everyone! 

Tags 
f11, f21, fibonacci, fn1, fn2, function, n>2 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Graphic card not function  naiveboy  Computer Hardware  0  November 25th, 2012 08:06 AM 
How to write a user defined function in Excell?  mfetch22  Computer Software  0  June 18th, 2010 06:33 PM 