You are here

Proof without Words: Recursion

The author presents a visual proof of the closed form of a recursively defined sequence: \(a_2 = 3\) and \(a_n = 2 a_{n-1} + 1\)

Old Node ID: 
1846
Author(s): 
Shirley Wakin (University of New Haven)
Publication Date: 
Thursday, June 5, 2008
Original Publication Source: 
Mathematics Magazine
Original Publication Date: 
June, 1989
Subject(s): 
Discrete Mathematics
Recursion
Flag for Digital Object Identifier: 
Publish Page: 
Furnished by JSTOR: 
File Content: 
Rating Count: 
15.00
Rating Sum: 
39.00
Rating Average: 
2.60
Author (old format): 
Shirley Wakin
Applicable Course(s): 
3.7 Discrete Math
4.1 Introduction to Proofs
Modify Date: 
Tuesday, July 29, 2008
Average: 2.8 (16 votes)

Dummy View - NOT TO BE DELETED