1 / 10

Sequences and Mathematical Induction

Sequences and Mathematical Induction. An important task of mathematics is to discover and characterize regular patterns, such as those associated with repeated processes. The main mathematical structure to study repeated processes is the sequence .

rumer
Télécharger la présentation

Sequences and Mathematical Induction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Sequences and Mathematical Induction An important task of mathematics is to discover and characterize regular patterns, such as those associated with repeated processes. The main mathematical structure to study repeated processes is the sequence. The main mathematical tool to verify conjectures about patterns in sequences is mathematical induction.

  2. Sequences • Sequence is a set of elements written in a row: am, am+1, …, an . • The elements are called terms. • k is called subscript or index of ak . • am is the initial term; an is the final term. • am, am+1, am+2, … is an infinite sequence.

  3. Sequences • Sequences characterize regular patterns. • Examples: 1) 1, 8, 15, 22, 29 . 2) 2, 4, 8, 16, 32, 64, … 3) 2, 3, 5, 7, 11, 13, 17, …

  4. Explicit Formula for a sequence • Explicit (general) formula is a rule that shows how the values of ak depend on k. • Examples: 1) ak=1+7k for 1, 8, 15, 22, 29 . 2) bk=2kfor 2, 4, 8, 16, … 3) ck= (-1)k · (2k+1) for -3, 5, -7, 9, …

  5. Summation Notation • Let m and n be integers such that m ≤ n. Then We call k index of the summation; m the lower limit of the summation; n the upper limit of the summation. • Ex.:Suppose a3=2, a4=-4, a5=0, a6=7. Then

  6. Explicit formula for summation • Example:If ak=2k then • Note that the index of summation is a dummy variable, so can be replaced by any other symbol: Ex: i=k+1 is called change of variable.

  7. Product Notation • Let m and n be integers such that m ≤ n. Then • Examples:   For each nZ+, is called n factorial. E.g., 4! = 1 · 2 · 3 · 4 = 24 Note: 0! = 1

  8. Binary representation of integers • Recall that if a = pk· 2k + pk-1· 2k-1 + … + p1· 21 + p0· 20 then a10 = (pk pk-1 … p1 p0)2 , wherep0, p1, …, pk-1, pkis a sequence of binary digits 0 and 1. • Question: How to find p0, p1, …, pk-1, pk?

  9. Converting from base 10 to base 2 14 = 7· 2 + 0 7 = 3 · 2 + 1 3 = 1 · 2 + 1 1 = 0 · 2 + 1 14 = 7 · 21 + 0 · 20 = ( 3·2 + 1 ) · 21 + 0 · 20 = 3 · 22 + 1 ·21 + 0 · 20 = ( 1·2 + 1 ) · 22 + 1 ·21 + 0 · 20 = 1 ·23 + 1 · 22 + 1 ·21 + 0 · 20

  10. Converting from base 10 to base 2 • 14= 1 ·23 + 1 · 22 + 1 ·21 + 0 · 20 Thus, 1410 = 11102 • Generally, to get binary representation for nonnegative integer a,  Repeatedly divide by 2 until a quotient of zero is obtained.  If the remainders found are r[0],r[1],…,r[k], thena10 = ( r[k] r[k-1] … r[1] r[0] )2 .

More Related