Sequences often occur in many branches of applied mathematics. Recurrence
relation is a powerful tool to characterize and study sequences. Some
commonly used methods for solving recurrence relations will be investigated.
Many examples with applications in algorithm, combination, algebra, analysis,
probability, etc, will be discussed. Finally, some well-known contest
problems related to recurrence relations will be addressed.
Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0626107-130246 |
Date | 26 June 2007 |
Creators | Chuang, Ching-hui |
Contributors | Mong-Na Lo Huang, Fu-Chuen Chang, Mei-Hui Guo |
Publisher | NSYSU |
Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
Language | Cholon |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0626107-130246 |
Rights | not_available, Copyright information available at source archive |
Page generated in 0.0012 seconds