Scribd
Upload
62 views3 pages

ARML 2013 - Algebraic Recursion: Victoria Xia March 21st, 2013

The document discusses techniques for finding the nth iteration of a function f(x), denoted f(n)(x), or the general term of a recursive sequence an. It covers three basic functions and their nth iterations: f(x) = x + k, f(x) = kx, and f(x) = xk. It also discusses using telescoping, finding a related sequence bn where bn is easier to find the general term of, and using the characteristic equation to find the general term of a linear recurrence relation.

Uploaded by

Axel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views3 pages

ARML 2013 - Algebraic Recursion: Victoria Xia March 21st, 2013

The document discusses techniques for finding the nth iteration of a function f(x), denoted f(n)(x), or the general term of a recursive sequence an. It covers three basic functions and their nth iterations: f(x) = x + k, f(x) = kx, and f(x) = xk. It also discusses using telescoping, finding a related sequence bn where bn is easier to find the general term of, and using the characteristic equation to find the general term of a linear recurrence relation.

Uploaded by

Axel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ARML 2013 - Algebraic Recursion

Victoria Xia
March 21st, 2013

Problems often come up where, given a function f (x), it’s helpful to know f (f (f (...f (f (x))...))) = f (n) (x).
The notation “f (n) (x)” (where there are n f ’s) is the nth iteration of f . Another version of the same idea
is a recursive sequence expressing an+1 in terms of an , such as an+1 = 2an + 1. To see why these are the
same, let x = a0 . Then f (x) = a1 , f (2) (x) = a2 , and so on.

This lecture covers techniques on how to find the nth iteration of a function or the general term of a recursive
sequence.

Below are three basic functions that we know how to handle:

f (x) = x + k ⇒ f (n) (x) = x + nk


f (x) = kx ⇒ f (n) (x) = k n x
n
f (x) = xk ⇒ f (n) (x) = xk

And some more to keep in mind:


 n(n + 1) 
an = an−1 + kn ⇒ an = a0 + k
2
 n(n + 1)(2n + 1) 
an = an−1 + kn2 ⇒ an = a0 + k
6
 n(n + 1) 2
an = an−1 + kn3 ⇒ an = a0 + k
2

0 Telescoping
Like yesterday’s NYCIML!

1 Finding bn (or g(x))


The idea is that if we can find a series bn , such that we can easily convert between an and bn , and we know
how to find the general term bn , then we have a way to find an . This will make a lot more sense with
examples.

1.1 Example
Given that an+1 = a2n + 2an for all integers n ≥ 0, if a0 = 4, find a150 .

Solution: The right side reminds us of perfect squares. Adding one to both sides yields an+1 + 1 =
n
a2n + 2an + 1 = (an + 1)2 . Making the substitution bn = an + 1, we have bn+1 = b2n , so bn = b20 . Converting
n n 150
back from bn to an , we have an + 1 = (a0 + 1)2 ⇒ an = (a0 + 1)2 − 1 ⇒ a150 = 52 − 1.

1
1.2 The Common an+1 = can + d
Linear relations are easy to transform by adding a constant λ to both sides of the equation: an+1 + λ =
c(an + d+λ d+λ
c ). If we could find a λ so that λ = c , then the equation would look like the second of the three
d d d
basic functions. Solving for λ, we get λ = c−1 . Replacing λ, we then have (an+1 + c−1 ) = c(an + c−1 ),
d n
and letting bn = (an + c−1 ), we have bn+1 = cbn . From the second basic equation, we then have bn = c b0 .
Replacing bn we have
d d
an + = cn (a0 + )
c−1 c−1
d d
an = cn (a0 + )− .
c−1 c−1
Example: (HMMT2013) Values a1 , a2 , ...a2013 are chosen independently and at random from the set
{1, 2, ..., 2013}. What is the expected number of distinct values in the set {a1 , a2 , ..., a2013 }?

2 Linear Recurrences and Characteristic Equations


The recurrence relation an = c1 an−1 +c2 an−2 +· · ·+cd an−d has the general term an = k1 r1n +k2 r2n +· · ·+kd rdn ,
where r1 , r2 , ..., rd are the distinct roots of the characteristic polynomial f (x) = xd −c1 xd−1 −c2 xd−2 −· · ·−cd ,
and k1 , ..., kd are constants. (Note that if the roots of the characteristic polynomial are not distinct then the
form changes slightly.)

Example: (AoPS) Let there be a sequence {an } with initial values a0 = 0, a1 = 38, a2 = −90 given by the
recurrence relation an+1 = 19an−1 − 30an−2 for n ≥ 2. Prove that a2010 is divisible by 2011.

3 Other Tips
1. Ranges are helpful. If, for instance, a problem states that the function only applies for values of x
between -1 and 1, think sine or cosine!

Example: Let an+1 = 4an (1 − an ), 0 ≤ an ≤ 1 for all an . Find the general term an if a0 = 41 .
Solution: The given range perfectly allows for the substitution an = sin2 (bn ). Substituting, we get
sin2 (bn+1 ) = 4 sin2 (bn )(1 − sin2 (bn )) = 4 sin2 (bn ) cos2 (bn ) = sin2 (2bn ), so bn+1 = 2bn . That means that
√
bn = 2n b0 , and it follows that an = sin2 (bn ) = sin2 (2n b0 ) = sin2 (2n arcsin( a0 )). The last step comes
√
from the fact that an = sin2 (bn ) implies bn = arcsin( an ). Substituting in the fact that a0 = 41 , we
n n−1
then have an = sin2 ( 2 6π ) = sin2 ( 2 3 π ).
2. List out the first few terms of a sequence if you don’t know what to do; easy problems will usually
reveal a pattern.

4 Problems
1. Five monkeys discover a pile of peaches by a lake. They agree to divide the pile evenly the next day.
The next morning, the first monkey comes and tries to split the pile into five equal parts, but fails
because there’s one left over. His solution is to toss one peach into the lake, and then takes one pile
(1/5 of what’s left) and leaves. The second monkey comes, but doesn’t know the first one already took
his share, so he tries splitting the pile into fifths, but ends up with one left over. He tosses a peach into
the lake, takes his share, and leaves. The third, fourth, and fifth monkeys all have the same problem
and do the same thing. What is the least number of peaches that could’ve been in the original pile?

2
2. Let f (x) = 19x + 89. Find the ones digit of f (100) (5).
3. Given that f (x) = 2x2 + 2x for − 21 ≤ x, find f (n) (x).

4. If a0 = 1 and an+1 = (n + 1)an + (n + 2)! for n ≥ 0, find an .


x−3
5. Let f (x) = x+1 for x 6= ±1. Find f (27) (x).
6. Find the general term Fn of the Fibonacci sequence defined by F0 = F1 = 1 and Fn = Fn−1 + Fn−2
for n ≥ 2.
7. Given that an+1 = 2a2n − 1 and -1 ≤ an ≤ 1 for all an , find the general term an .
√
8. Let f (x) = 2 + x, -2 ≤ x ≤ 2. Find f (n) (x). (Hint: Half angle formula! Also, the range being from
-2 to 2 instead of -1 to 1 means something...)
9. Find f (n) (x) for f (x) as defined in Question 6, but for the domain x > 2.

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