Question One
Question
Let be a sequence defined recursively as and . Use induction to prove that for all .
Solution
…
Question Two
Question
Let be a sequence defined recursively as , , and for . Use induction to prove that for all .
Solution
…
Question Three
Question
Let the universal set be , and let be the set of all odd integers in , let , and . Determine each of the following sets and list their elements:
-
;
-
;
-
;
-
.
Solution
…
Question Four
Question
Use Venn diagrams to prove that for any sets , , and .
Solution
…
Question Five
Question
Use the properties of operations on sets to simplify the expression .
Solution
…
Question Six
Question
Solve the simultaneous system of inequalities using intersection of solutions of individual inequalities and write the solution as a set:
Solution
…
Question Seven
Question
Prove, based on the definitions, that .
Solution
…
Question Eight
Question
Use mathematical induction to prove that every positive integer can be represented as where and are non-negative integers.
Hint: Verify induction base for , then use the Cumulative Axiom of Mathematical Induction (C.A.M.I).
Solution
…
Question Nine
Question
Consider the function , and define recursively a sequence of functions and .
Hint: Calculate , , and , then make a guess the definition, and then prove your guess by induction.
Solution
…