Logic — math, philosophy & computational aspects
logic, math, philosophy, math games, math help, mathematical logic, philosophy of education, math facts
discussion group
in a rss
27
Feb
Fibinocci Number Proof
Use mathematical Induction to show that for n >= 1,
Fn < 2^n
Where Fn is a Fibinocci number.
No Comments
Place your comment
You must be
logged in
to post a comment.
Archives
February 2012
January 2012
November 2011
October 2011
September 2011
August 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
Recent Posts
See Hot Sexy Star Aishwarya Rai Videos In All Angles.
THE CANTOR ARGUMENT SO FAR
Solomon Feferman's notion of the "unfolding" of ZF
Muddled query about models of ZF.
CANTOR DISPROOF <<<<<<<<<<<<<<<<
Peter Koellner's thesis
See Hot Sexy Star Aishwarya Rai Videos In All Angles
ANTI-CANTOR CLAIM
KBH Word Coordinates for Shorter Text Messaging
Con this be done without invoking AC?
Place your comment
You must be logged in to post a comment.