Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
54 views
3 pages
Ex2 4
Uploaded by
whyalwaysarnab
AI-enhanced title
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download
Save
Save ex2_4 For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
0 ratings
0% found this document useful (0 votes)
54 views
3 pages
Ex2 4
Uploaded by
whyalwaysarnab
AI-enhanced title
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Carousel Previous
Carousel Next
Download
Save
Save ex2_4 For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
Download
Save ex2_4 For Later
You are on page 1
/ 3
Search
Fullscreen
168 2/ Basic Suuctures: Sets, Functions, Sequences, Sums, and Matrices f) the sequence whose nth term is the largest integer ‘whose binary expansion (defined in Seetion 4.2) has bits (Write your answer in decimal notation ) 2) the sequence whose lerms aze constructed sequen- tially a follows: start with 1, then ada 1, then multiply by 1, then add 2, then multiply by 2, and so on 1b) the sequence whose mth term isthe largest integer k such that 1 = 7. Find atleast thee different sequences beginning with the terms 1, 2, 4 whose terms are generated by a simple for- mula of rule 8, Find atleast three different sequences beginning with the terms 3, 5,7 whose terms are generated by a simple for- rula ort Fring tne first five tems ofthe sequence defined by each of these recurrence relations and inital conditions 3) dn = 6ae-1, 40 pat + Baya, 49 = 1 a = mays + n*ay—2,.a9 = 1, ay = 1 ©) ay = dyn + dys, a9 = 1, ay = 2,02 =0 10, Bind the first six terms of the sequence defined by each of these recurrence relations and initial conditions 8) ay = —2ap b) a, = ay 245.3" form a) Find ap, ay, a, a3, and ay b) Show that a; = Sa; — 600, a3 = Sa — Gay, and ‘ag = Sa — 6a, ©) Show that ay = Say—1 ~ 6dy-2 forall integers m with n=2 12. Show thatthe sequence (ay) isa solution ofthe recurrence relation ay = —3ay-1 + 4ay_2 if a) a, = 0, b) ay =1 ©) ay = (4) @) ay = 2-4)" +3. 43. Is the sequence {ay} a solution of the recurrence relation (y= 8dy—) — 16dy-3 if a) a, = 0? b) a= 9) a2 @ a, = 3" ©) a sna"? 1) ay = 2.4% 43nd"? Bae = 4"? by ay = m4 14, For each of these sequences find a recurrence relation satisfied by this sequence. (The answers are not unique because there are infinitely many different recurrence relations satisfied by any sequence ) a) on =3 b) ay = 2n ©) ay =2n +3 @) a= 3" gan 0) ay =m on Bante bb) ay =n! 15. Show thatthe sequence (a,) isa solution ofthe recurrence elation dy = ayy + 2ayea + 2m — 9if a) a =—n +2 b) ay = S(—1) =n 42. 16 18, ws. 20, a 22, ©) ay = SD" $2" 42. @) ay =7-2" 042. Find the solution to eachof there recurrence relations with the giveninitial conditions. Use aniteratve approach suc as that used in Example 10. 8) ty = —ty-3,.00 = 5 by ay = dy + 3,09 = 1 ©) ty = ayy =m a9 = 4 ) ay = 2aq-1 = 3,09 = 1 ©) ay = (+ Dagat, a0 £) ay = 2nayat, ao =3 B) dy = ayaa bm = Led 7 Find the solution o etch ofthese recurrence relations and initial conditions. Use an iterative approach such as that used in Example 10. 8) ay = Bayt, a9 = 2 ) ay = ay +2, a9 = 3 ©) ay = ayy +m a9 = 1 A) ay = any +20 +3, 09 = ©) ay = 2-1 — Lay 1) ay =3Bap-1 + Lag =I 8) ay = dy—t, ao = 5 Bb) ay = 2nd. a9 = 1 ‘A person deposits $1000 in an account that yields 9% interest compounded annually. a) Setup a recurrence relation forthe amount inthe ac- ‘count at the end of years. ») Find an explicit formula forthe amountin the account atthe end of m years ©) How much money will the account contain after 100 Suppose that the number of bacteria in a colony triples every hour, a) Setup arecurrence relation forthe number of bacteria after n hours have elapsed, by If 100 bacteria are used to begin a new colony, how ‘many bacteria will be inthe colony in 10 hours? ‘Assume that the population of the world in 2010 was 6.9 billion and is growing at the rae of 1.1% a year fa) Set up a recurrence relation for the population of the world n years after 2010. by Find an explicit formula for the population of the world n years after 2010, ©) What will the population of the world be in 2030? 'A factory makes custom sports cars at an increasing rate Ta the first month only one car is made, in the second rroath two cars ate made, and so on, with n cars made in the nth month. a) Set up a recurrence relation for the number of cars produced in the first m months by this factory ) How many cars are produced in the fst year? ©) Find an explicit formula for the number of cars pro- duced in the frst months by this factory. ‘An employee joined company in 2009 with a starting salary of $50,000. Every year this employee receives a rajse of $1000 plus 5% of the salary ofthe previous year.24. 2s, 77 #28, 2. a) Setup a recurrence relation forthe salary of this em- ployee m years after 2009, 'b) What will the salary of tis employee be in 2017? ©) Find an explicit formula for the salary of this em- ployee m years after 2009, . Find a recurrence relation forthe balance B(k) owed at the end of & months on a loan of $5000 at arate of 7% if a payment of $100 is made each month, (Hint: Exe press BG) i tems of BG ~ 1); the monthly interest is (0071284 =) 4) Finda recurrence relation forthe balance B(R) owedat theendot k months onaloanatarate of itapayment is made on the loan each month, (Ulint: Express BG) in texms of B(k—1) and note that the mostly interest rate i /12] 'b) Determine what the monthly payment P should be so thatthe loan is paid off after 7 months For each ofthese lists of integers, provide a simple for aula or sue that generates the terms of an integer se- «quence that begins with the given lit, Assuming that your formula orrule is comet, determine the next thee terms ofthe sequence 8) 1.0,1,1,0.0,1,1,1.0,0,0,1 b)12,2.3.4.4,5,6.6.7.8,8 ©) 1.0.2,0,4,0,8,0,16,0, 4) 3.6. 12,24, 48,96, 192, ©) 15,8,1,~6,—18,-20, 27, £) 3.5.8, 12. 17,23, 30.38, 47 2) 216,54, 128, 250, 432, 686, hy 2.3, 7,25, 121, 721, $041, 40821 For each of thes ists of integers, provide a simple for mula or rule that generates the terms of an integer se- «quence that begins withthe given list, Assuming that your formula orrule is conect, determine the net thee terms ofthe sequence. a) 3.6.1, 18.27, 38,51, 66,83, 102 by 7.11, 15, 19,25, 27.31, 35,38, 43, ©) 1.10, 11, 100, 101, 110,111, 1000, 1001, 1010, 1011. @) 1,2,2,2,3,3,3,3,3.5,5,5.5,5,5.5, ©) 0,2, 8,26, 80, 242, 728, 2186, 6560, 19682, £) 1.3.15, 105,945, 10395, 135135, 2027025, saasouns, 8) 1,0,0,1,1,1,0,0,0,0.1,1,1,1,1 By 2.4, 16,256, 65536, 294967296, Show that ay denotes the nth positive integer thats not aperfectaquate then gy = n-+ (i), where (x} denotes the integer closest to the real nuber x Letaybethenthtermof he sequence 1,2,2,3,3,3,4,4,4, 4,5,5,5,5,5,6,6,6,6.6,6,..., constructed by including theintegerkexactly times: Show thatay = [Vr $] What are the values ofthese sums? a» Seen » en! © Sart oys 2.4 Sequences and Summations 169 30, Whatare the values of these sums, where = (1,3, 5.7)? or b) Le 9 yay aya S31. What is the value of each of these sums of terms of a ‘geometric progression? : : » yaa » Sy ‘ ‘ 9 Ses! ® Seay @rnd te vate ofeach of hee sams » Savevy — w Ser—-2 8 Sev43.% ao Lat—2h Geonpure cach ofthese double sums ay vara bY Var 34. Compute each ofthese double sums aeee-p wy vere ops oyeer 38. Show that S°5_s(aj—ay-1) = dy — ao, where (4,4), ---. ty is & sequence of real numbers. This (ype cof sun i called telescoping 36, Use the identity 1/(k( +19) = 1/k— 1/41) and Broreise 35 to compute Yf_ 1/(kk + 1)) 37, Sum both sides of the identity 2 - (k— 1)? = 2-1 fom k = 1 0k = n and use Exercise 3510 find 4) afommula for S22 = 1) (the sum ofthe first n odd natural mamber). 1) a formula for fk #38, Use the technique given in Exercise 35, together withthe sesult of Exercise 37, (o detive the formula for °f_ #? siven in Table 2 [int: Take ay = &° inthe telescoping som in Exercise 35) Find )°} jook. (Use Table 2.) Find 2k? (Use Table 2) a, Find a formola for Y integer. "olVR), when m is postive 142, Find a formula for SP [YE], when m isa postive inte There ie also a special notation for ucts, The product of Anis represented by [| aj, read as the prod vet from j = mto j =n ofa,170 2/Basic Swuctures: Sets, Functions, Sequences, Sums, and Matrices @ Wa are te values ofthe flowing rode? 4. apes using product notation a) E208 b) Ts! © TES 1 4 2 43. Find S49 i! Recall thatthe value ofthe factorial function ata positive ine tegern, denoted by n!, is the product ofthe positive integers . from I ton, inclusive, Als, we specify that 0! = 1 46, Find TT} 0! Cardinality of Sets DEFINITION 1 DEFINITION 2 Introduction In Definition 4 of Section 2.1 we defined the cardinality ofa finite set as the number of elements in the set, We use the cardinalities of finite sets to tell us when they have the same size, or when cone is bigger than the other, In this section we extend this notion to infinite sets. That is, we will define what it means for two infinite sets to have the same cardinality, providing us with a way to measure the relative sizes of infinite sets, ‘We will be particularly interested in countably infinite sets, which are sets with the same cardinality as the set of positive integers. We will establish the surprising result that the set of rational numbers is countably infinite. We will also provide an example of an uncountable set ‘when we show thatthe set of real numbers is not countable. ‘The concepts developed in this section have impertant applications to computer science. A. function is called uncomputable if no computer program can be written (o find all its values, even with unlimited time and memory. We will use the concepts in this section to explain why uncomputable functions exist, ‘We now define what it means for two sets to have the same size, or cardinality. In Section 2.1, wwe discussed the cardinality of finite sets and we defined the size, or cardinality, of such sets. In Exercise 79 of Section 2.3 we showed that there is a one-to-one correspondence between any ‘wo finite sets with the same number of elements. We use this observation to extend the concept of cardinality to all sets, both finite and infinite. ‘The sets A and B have the same cardinality if and only if there is a one-to-one correspondence from A to B. When A and B have the same cardinality, we write |A| = |B For infinite sets the definition of cardinality provides a relative measure of the sizes of two sets, rather than a measure of the size of one particular set, We can also define what it means for one set to have a smaller cardinality than another set. If there is a one-to-one function from A to B, the cardinality of A is less than or the same as the cardinality of B and we write [Al < |B]. Moreover, when |A| = |B| and A and B have different cardinality, we say that the cardinality of A is less than the cardinality of Band we waite [Al < |B Countable Sets We will now split infinite sets into two groups, those with the same cardinality as the set of natural numbers and those with a different cardinality
You might also like
0.introduction To DS - Sorting - Searching
PDF
No ratings yet
0.introduction To DS - Sorting - Searching
79 pages
Recurrence Relations and Generating Functions - GDLC
PDF
No ratings yet
Recurrence Relations and Generating Functions - GDLC
144 pages
Sequence, Sigma and Pi
PDF
No ratings yet
Sequence, Sigma and Pi
3 pages
Assignment 02 (PHY-107) - 1
PDF
No ratings yet
Assignment 02 (PHY-107) - 1
2 pages
Demetrios P. Kanoussis - Sequences of Real and Complex Numbers (2017) PDF
PDF
No ratings yet
Demetrios P. Kanoussis - Sequences of Real and Complex Numbers (2017) PDF
128 pages
Recurrence Relations
PDF
No ratings yet
Recurrence Relations
12 pages
Lec-3 - Classification of Living Things
PDF
No ratings yet
Lec-3 - Classification of Living Things
21 pages
2015 Examsols
PDF
No ratings yet
2015 Examsols
11 pages
Recurrence Relations
PDF
No ratings yet
Recurrence Relations
58 pages
Chain Rule
PDF
No ratings yet
Chain Rule
6 pages
02-Berhitunglanjut Slides
PDF
No ratings yet
02-Berhitunglanjut Slides
47 pages
12 Unit1
PDF
No ratings yet
12 Unit1
40 pages
DMS Notes PDF
PDF
No ratings yet
DMS Notes PDF
80 pages
Chapter 2 Advance Counting Technique
PDF
No ratings yet
Chapter 2 Advance Counting Technique
94 pages
Recurrence Relations
PDF
0% (1)
Recurrence Relations
54 pages
Discrete Mathematics, Spring 2004 Homework 6 Sample Solutions
PDF
No ratings yet
Discrete Mathematics, Spring 2004 Homework 6 Sample Solutions
5 pages
Discrete Mathematics
PDF
No ratings yet
Discrete Mathematics
45 pages
Recurrence Relation 2
PDF
No ratings yet
Recurrence Relation 2
13 pages
Ex1 6
PDF
No ratings yet
Ex1 6
3 pages
Ex2 3
PDF
No ratings yet
Ex2 3
3 pages
Report On Recursion
PDF
No ratings yet
Report On Recursion
12 pages
Algebraic Combinatorics: 1 Formal Series
PDF
No ratings yet
Algebraic Combinatorics: 1 Formal Series
12 pages
NCSC 201 Discrete Mathematics Notes
PDF
No ratings yet
NCSC 201 Discrete Mathematics Notes
39 pages
Discrete Mathematics Code
PDF
No ratings yet
Discrete Mathematics Code
127 pages
DM Hw7 Problems Solution
PDF
No ratings yet
DM Hw7 Problems Solution
10 pages
Discrete Structure Chapter 6-Recurrence Relation
PDF
No ratings yet
Discrete Structure Chapter 6-Recurrence Relation
38 pages
Generating Functions
PDF
No ratings yet
Generating Functions
10 pages
Generating Functions
PDF
No ratings yet
Generating Functions
13 pages
18.312 Algebraic Combinatorics: Mit Opencourseware
PDF
No ratings yet
18.312 Algebraic Combinatorics: Mit Opencourseware
6 pages
Short Tutorial On Recurrence Relations
PDF
No ratings yet
Short Tutorial On Recurrence Relations
13 pages
Chapter 3: Recursion, Recurrence Relations, and Analysis of Algorithms
PDF
No ratings yet
Chapter 3: Recursion, Recurrence Relations, and Analysis of Algorithms
23 pages
Particular Solutions To Non Homogeneous Recurrence Relations 1
PDF
No ratings yet
Particular Solutions To Non Homogeneous Recurrence Relations 1
5 pages
Recurrence Relation
PDF
No ratings yet
Recurrence Relation
5 pages
Notes UNIT2 Recurrence Relations MTH401
PDF
No ratings yet
Notes UNIT2 Recurrence Relations MTH401
29 pages
Unit 7 CH 9 WS Solutions
PDF
No ratings yet
Unit 7 CH 9 WS Solutions
7 pages
13 Stirling Numbers 20-11-2024
PDF
No ratings yet
13 Stirling Numbers 20-11-2024
66 pages
Recurrence Relation and Generating Function
PDF
No ratings yet
Recurrence Relation and Generating Function
18 pages
mth202 Lecture21-Recursion
PDF
No ratings yet
mth202 Lecture21-Recursion
10 pages
Sequences Series Practice Set
PDF
No ratings yet
Sequences Series Practice Set
2 pages
DiscreteMaths Unit4 Notes
PDF
No ratings yet
DiscreteMaths Unit4 Notes
30 pages
Recurrence Relation
PDF
No ratings yet
Recurrence Relation
8 pages
Lec 08 Z Recurrence
PDF
No ratings yet
Lec 08 Z Recurrence
27 pages
Tut
PDF
No ratings yet
Tut
2 pages
Lecture 08
PDF
No ratings yet
Lecture 08
27 pages
Recurrence Relations DM
PDF
No ratings yet
Recurrence Relations DM
12 pages
DM 5
PDF
No ratings yet
DM 5
36 pages
11 Sequences 1
PDF
No ratings yet
11 Sequences 1
38 pages
Recurrence Relations and Generating Func
PDF
No ratings yet
Recurrence Relations and Generating Func
33 pages
Content
PDF
No ratings yet
Content
12 pages
Lecture-5 3
PDF
No ratings yet
Lecture-5 3
19 pages
Week 11
PDF
No ratings yet
Week 11
5 pages
Problemset 4 - Sequence, Summation, Recurrence Solution
PDF
No ratings yet
Problemset 4 - Sequence, Summation, Recurrence Solution
7 pages
Putnam Seq
PDF
No ratings yet
Putnam Seq
6 pages
Calculas Mid 2 Questions
PDF
No ratings yet
Calculas Mid 2 Questions
10 pages
Discrete Mathematics - Recurrence Relation
PDF
No ratings yet
Discrete Mathematics - Recurrence Relation
6 pages
Generating Functions
PDF
No ratings yet
Generating Functions
22 pages
Math158 SPformidterm 24-25 Fall
PDF
No ratings yet
Math158 SPformidterm 24-25 Fall
17 pages
Recurrence Relations
PDF
No ratings yet
Recurrence Relations
9 pages
CH 4
PDF
No ratings yet
CH 4
41 pages
0s8yry - 305. Module 03 - Additional Practice Questions PDF - Mod3 - Discrete Maths - Class Note PDF
PDF
No ratings yet
0s8yry - 305. Module 03 - Additional Practice Questions PDF - Mod3 - Discrete Maths - Class Note PDF
3 pages
Recurrence Relation
PDF
No ratings yet
Recurrence Relation
21 pages
Discrete Mathematical Structures Unit 1 Part 2
PDF
No ratings yet
Discrete Mathematical Structures Unit 1 Part 2
70 pages
Day 15 Problem Set
PDF
No ratings yet
Day 15 Problem Set
3 pages