You are here

Proof without Words: Recursion

by Shirley Wakin (University of New Haven)

This article originally appeared in:
Mathematics Magazine
June, 1989

Subject classification(s): Discrete Mathematics | Recursion
Applicable Course(s): 3.7 Discrete Math | 4.1 Introduction to Proofs

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\)

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Average: 2.8 (16 votes)