Description
All algorithms/proofs should be in bullet form: step by step.
-
Exercise 3, Page 22
-
Exercise 4, on Page 22
-
Exercise 6 on page 25
-
Exercise 4 on page 67
-
(a) Prove (by induction) that sum of the rst n integers (1+2+::::+mn) is n(n + 1)=2
-
-
What is 13 + 23 + 34 + ::: + n4 = ?? Prove your answer by induction.
-
-
How many tries do you need (in the worst case) in the two egg problem when there are 200 steps? what about n steps?
1
