Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
The Pell sequence
Ayoub A. Mathematics and Computer Education36 (1):5-12,2002.Type:Article
Date Reviewed: Jun 12 2003

This paper addresses the elementary properties of the Pell sequence an, which is defined by the initial terms a0 = 0, a1 = 1, and by the recursion an+1 = 2an + an-1. A closed analytical formula for the members of the sequence, established connections with the Pell equation x2 - 2y2 = ±1, and with primitive Pythagorean triples, are proven. Sums and quotients related to this sequence are studied. All of the results presented are well known, and the problems discussed are exercises at an undergraduate level. On the other hand, the presentation does have some didactic value.

Reviewer:  A. Pethö Review #: CR127773 (0309-0915)
Bookmark and Share
 
Recurrences And Difference Equations (G.2.1 ... )
 
 
Miscellaneous (G.2.m )
 
Would you recommend this review?
yes
no
Other reviews under "Recurrences And Difference Equations": Date
Discrete dynamical systems: theory and applications
Sandefur J., Clarendon Press, New York, NY, 1990. Type: Book (9780198533849)
Jul 1 1991
An efficient formula for linear recurrences
Fiduccia C. SIAM Journal on Computing 14(1): 106-112, 1985. Type: Article
Oct 1 1985
Unique extrapolation of polynomial recurrences
Lagarias J., Reeds J. SIAM Journal on Computing 17(2): 342-362, 1988. Type: Article
Aug 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy