Sequences and Summations CS 202 Epp, section 4.1 Aaron Bloomfield 1

Sequences and Summations CS 202 Epp, section 4.1 Aaron Bloomfield 1

Definitions Sequence: an ordered list of elements – Like a set, but: Elements can be duplicated Elements are ordered 2

Sequences A sequence is a function from a subset of Z to a set S – Usually from the positive or non-negative ints – an is the image of n an is a term in the sequence {an} means the entire sequence – The same notation as sets! 3

Sequence examples an 3n – The terms in the sequence are a1, a2, a3, – The sequence {an} is { 3, 6, 9, 12, } bn 2n – The terms in the sequence are b1, b2, b3, – The sequence {bn} is { 2, 4, 8, 16, 32, } Note that sequences are indexed from 1 – Not in all other textbooks, though! 4

Geometric vs. arithmetic sequences The difference is in how they grow Arithmetic sequences increase by a constant amount – – – – an 3n The sequence {an} is { 3, 6, 9, 12, } Each number is 3 more than the last Of the form: f(x) dx a Geometric sequences increase by a constant factor – – – – bn 2n The sequence {bn} is { 2, 4, 8, 16, 32, } Each number is twice the previous Of the form: f(x) arx 5

Fibonacci sequence Sequences can be neither geometric or arithmetic – Fn Fn-1 Fn-2, where the first two terms are 1 Alternative, F(n) F(n-1) F(n-2) – Each term is the sum of the previous two terms – Sequence: { 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, } – This is the Fibonacci sequence n – Full formula: 1 5 1 5 F ( n) 5 2 n n 6

Fibonacci sequence in nature 13 8 5 3 2 1 7

Reproducing rabbits You have one pair of rabbits on an island – The rabbits repeat the following: Get pregnant one month Give birth (to another pair) the next month – This process repeats indefinitely (no deaths) – Rabbits get pregnant the month they are born How many rabbits are there after 10 months? 8

Reproducing rabbits First month: 1 pair – The original pair Second month: 1 pair – The original (and now pregnant) pair Third month: 2 pairs – The child pair (which is pregnant) and the parent pair (recovering) Fourth month: 3 pairs – “Grandchildren”: Children from the baby pair (now pregnant) – Child pair (recovering) – Parent pair (pregnant) Fifth month: 5 pairs – Both the grandchildren and the parents reproduced – 3 pairs are pregnant (child and the two new born rabbits) 9

Reproducing rabbits Sixth month: 8 pairs – All 3 new rabbit pairs are pregnant, as well as those not pregnant in the last month (2) Seventh month: 13 pairs – All 5 new rabbit pairs are pregnant, as well as those not pregnant in the last month (3) Eighth month: 21 pairs – All 8 new rabbit pairs are pregnant, as well as those not pregnant in the last month (5) Ninth month: 34 pairs – All 13 new rabbit pairs are pregnant, as well as those not pregnant in the last month (8) Tenth month: 55 pairs – All 21 new rabbit pairs are pregnant, as well as those not pregnant in the last month (13) 10

Reproducing rabbits Note the sequence: { 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, } The Fibonacci sequence again 11

Fibonacci sequence Another application: Fibonacci references from http://en.wikipedia.org/wiki/Fibonacci sequence 12

Fibonacci sequence As the terms increase, the ratio between successive terms approaches 1.618 F (n 1) 5 1 1.618933989 n F ( n) 2 lim This is called the “golden ratio” – Ratio of human leg length to arm length – Ratio of successive layers in a conch shell Reference: http://en.wikipedia.org/wiki/Golden ratio 13

The Golden Ratio 14

15

Determining the sequence formula Given values in a sequence, how do you determine the formula? Steps to consider: – Is it an arithmetic progression (each term a constant amount from the last)? – Is it a geometric progression (each term a factor of the previous term)? – Does the sequence it repeat (or cycle)? – Does the sequence combine previous terms? – Are there runs of the same value? 16

Determining the sequence formula a) 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, The sequence alternates 1’s and 0’s, increasing the number of 1’s and 0’s each time b) 1, 2, 2, 3, 4, 4, 5, 6, 6, 7, 8, 8, This sequence increases by one, but repeats all even numbers once c) 1, 0, 2, 0, 4, 0, 8, 0, 16, 0, The non-0 numbers are a geometric sequence (2 n) interspersed with zeros d) 3, 6, 12, 24, 48, 96, 192, Each term is twice the previous: geometric progression an 3*2n-1 17

Determining the sequence formula e) 15, 8, 1, -6, -13, -20, -27, Each term is 7 less than the previous term an 22 - 7n f) 3, 5, 8, 12, 17, 23, 30, 38, 47, The difference between successive terms increases by one each time a1 3, an an-1 n an n(n 1)/2 2 g) 2, 16, 54, 128, 250, 432, 686, Each term is twice the cube of n an 2*n3 h) 2, 3, 7, 25, 121, 721, 5041, 40321 Each successive term is about n times the previous an n! 1 My solution: an an-1 * n - n 1 18

OEIS: Online Encyclopedia of Integer Sequences Online at http://www.research.att.com/ njas/sequences/ 19

Useful sequences n2 1, 4, 9, 16, 25, 36, n3 1, 8, 27, 64, 125, 216, n4 1, 16, 81, 256, 625, 1296, 2n 2, 4, 8, 16, 32, 64, 3n 3, 9, 27, 81, 243, 729, n! 1, 2, 6, 24, 120, 720, 20

Summations A summation: upper limit or n aj j m is like a for loop: n j m aj lower limit index of summation int sum 0; for ( int j m; j n; j ) sum a(j); 21

Evaluating sequences 5 (k 1) 2 3 4 5 6 20 k 1 4 ( 2) j (-2)0 (-2)1 (-2)2 (-2)3 (-2)4 11 j 0 3 3 3 3 3 3 3 3 3 3 30 10 3 i 1 8 2 j 0 j 1 2j (21-20) (22-21) (23-22) (210-29) 511 – Note that each term (except the first and last) is cancelled by another term 22

Evaluating sequences Let S { 1, 3, 5, 7 } What is j S j – 1 3 5 7 16 What is j S j2 – 12 32 52 72 84 What is j S (1/j) – 1/1 1/3 1/5 1/7 176/105 What is j S 1 – 1 1 1 1 4 23

Summation of a geometric series Sum of a geometric series: n 1 ar a n j ar r 1 j 0 (n 1)a if r 1 if r 1 Example: 10 1 2 1 2048 1 n 2 2047 2 1 1 j 0 10 24

n Proof of last slide If r 1, then the sum is: S ar j j 0 n rS r ar j j 0 n ar j 1 j 0 n S a (n 1)a j 0 n 1 ar k k 1 n ar k ar n 1 a k 0 rS S ar n 1 a rS S ar n 1 a S (r 1) ar n 1 a ar S a r 1 n 1 25

Double summations Like a nested for loop 4 3 ij i 1 j 1 Is equivalent to: int for for sum sum 0; ( int i 1; i 4; i ) ( int j 1; j 3; j ) i*j; 26

Useful summation formulae Well, only 1 really important one: n n(n 1) k 2 k 1 27

Cardinality For finite (only) sets, cardinality is the number of elements in the set For finite and infinite sets, two sets A and B have the same cardinality if there is a one-to-one correspondence from A to B 28

Cardinality Example on finite sets: – Let S { 1, 2, 3, 4, 5 } – Let T { a, b, c, d, e } – There is a one-to-one correspondence between the sets Example on infinite sets: – Let S Z – Let T { x x 2k and k Z } – One-to-one correspondence: 1 2 2 4 3 6 4 2 5 10 6 12 7 14 8 16 Etc. Note that here the ‘ ’ symbol means that there is a 29 correspondence between them, not the biconditional

More definitions Countably infinite: elements can be listed – Anything that has the same cardinality as the integers – Example: rational numbers, ordered pairs of integers Uncountably infinite: elements cannot be listed – Example: real numbers 30

Showing a set is countably infinite Done by showing there is a one-to-one correspondence between the set and the integers Examples – Even numbers Shown two slides ago – Rational numbers – Ordered pairs of integers Shown next slide 31

Showing ordered pairs of integers are countably infinite A one-to-one correspondence 32

Show that the rational numbers are countably infinite First, let’s show the positive rationals are countable See diagram: Can easily add 0 (add one column to the left) Can add negative rationals as well 1/1 2 /1 3 /1 4 /1 5 /1 1/ 2 2 / 2 3 / 2 4 / 2 5 / 2 1/ 3 2 / 3 3 / 3 4 / 3 5 / 3 1/ 4 2 / 4 3 / 4 4 / 4 5 / 4 1/ 5 2 / 5 3 / 5 4 / 5 5 / 5 33