Skip to Main Content
Library
LibGuides
Math 131
Induction & Recursion
Search this Guide
Search
Math 131: Induction & Recursion
Home
Logic & Proofs
Basic Structures
Algorithms
Number Theory & Cryptography
Induction & Recursion
Counting
Discrete Probability
Advanced Counting Techniques
Relations
Graphs
Trees
Boolean Algebra
Modeling Computation
Web resources
Lamé's Theorem - the Very First Application of Fibonacci Numbers
Mathematical induction
Mathematical induction
Mathematical induction
Proof method: Strong Induction
Videos to help you understand induction & recursion
Books at the SAU Library
The Haskell Road to Logic, Maths and Pro
by
Kees Doets
Call Number: QA76.63 .D64 2004
ISBN: 0954300696
Publication Date: 2004
How to Think about Algorithms
by
Jeff Edmonds
Call Number: QA9.58 .E36 2008
ISBN: 9780521849319
Publication Date: 2008
Super-Recursive Algorithms
by
Mark Burgin
Call Number: QA9.615 .B87 2005
ISBN: 0387955690
Publication Date: 2004
<<
Previous:
Number Theory & Cryptography
Next:
Counting >>
The Haskell Road to Logic, Maths and Pro by 
How to Think about Algorithms by 