Final Exam Comprehensive Review with
Verified Solutions | 100% Pass
Guaranteed | Graded A+ |
Administrator
[COMPANY NAME] [Company address]
, Discrete Math Final Exam Review with Verified Solutions
1. Recursion when an object's definition relies on that object
e.g. 2^n = 2x2^(n-1)
2. Induction the proof technique used to demonstrate facts
about re-
cursive definitions
3. Set (loosely speaking) is a collection of objects called
ele-
ments
e.g. if this class is a set, you are an element
We write x X when x is an element of the set X
4. list or rooter nota- tion
no- tation the set of posi- tive whole num- bers
the set of
whole
numbers
between 1 and
10 inclusive
5. list or rooter
no- tation
is the set of pos-
itive whole num-
bers
6. Set builder
nota- tion
7. set builder
nota- tion
the set of
whole
numbers
between 1 and
10 inclusive
8. set builder
2/
28
, Discrete Math Final Exam Review with Verified Solutions
{1,2,3,4,5,6,7,8,9,10
}
{1,2,3,4,...}
elements are
described by some
rule or property
{x | x is a whole
number and
1dxd10}
{n | n is a positive
whole number}
3/
28