Scribd
Upload
411 views1 page

Maths Notes (Recurrence Relations)

Recurrence relations define sequences where each subsequent term is defined by preceding terms in the sequence. A closed form formula expresses the nth term solely as a function of n, while a recurrence formula relates a term to previous ones. Examples given are arithmetic and geometric progressions, with closed forms providing the nth term directly and recurrence relations expressing each in terms of the prior. To convert a recurrence relation to a closed form, write the first few terms, observe their pattern to make an conjectured formula for the nth term.

Uploaded by

Teo Jia Ming Nickolas
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
411 views1 page

Maths Notes (Recurrence Relations)

Recurrence relations define sequences where each subsequent term is defined by preceding terms in the sequence. A closed form formula expresses the nth term solely as a function of n, while a recurrence formula relates a term to previous ones. Examples given are arithmetic and geometric progressions, with closed forms providing the nth term directly and recurrence relations expressing each in terms of the prior. To convert a recurrence relation to a closed form, write the first few terms, observe their pattern to make an conjectured formula for the nth term.

Uploaded by

Teo Jia Ming Nickolas
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Recurrence Relations

Definitions
1. A recurrence formula is one which each subsequent term is expressed in terms of one or more previous terms 2. Whereas a closed form formula is a general formula for the nth term in terms of n only.

Example
1. Arithmetic progression a. Closed form formula: i. While b. Recurrence formula: i. While 2. Geometric progression a. Closed form formula: i. While b. Recurrence formula: i. While

Conversion from recurrence relations to closed form formula


1. Write the values for the first few (~4) terms 2. Make a conjecture for the nth term a. A conjecture is a statement that s not proven yet, but observed from the pattern

Done by Nickolas TeoJia Ming, CG 12/11

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy