Scribd
Upload
30 views3 pages

EECS 203: Discrete Mathematics Fall 2019 Discussion 4 Notes: 1 Definitions

This document contains notes from a discrete mathematics discussion covering topics like functions, relations, recurrence relations, counting principles, and cardinality. It includes definitions of terms like onto, one-to-one, and bijection. It also lists exercises involving evaluating functions for different properties, solving recurrence relations, evaluating sums, and determining if sets are finite, countably infinite, or uncountably infinite. The document provides context for working through practice problems involving foundational discrete math concepts.

Uploaded by

sam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views3 pages

EECS 203: Discrete Mathematics Fall 2019 Discussion 4 Notes: 1 Definitions

This document contains notes from a discrete mathematics discussion covering topics like functions, relations, recurrence relations, counting principles, and cardinality. It includes definitions of terms like onto, one-to-one, and bijection. It also lists exercises involving evaluating functions for different properties, solving recurrence relations, evaluating sums, and determining if sets are finite, countably infinite, or uncountably infinite. The document provides context for working through practice problems involving foundational discrete math concepts.

Uploaded by

sam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

EECS 203: Discrete Mathematics

Fall 2019
Discussion 4 Notes
1 Definitions
• Function f : A → B:

• Onto:

• One-to-One:

• Bijection:

• f −1 :

• f ◦ g:

• Recurrence relation

• Countably Infinite

• Uncountably Infinite

• Schroder-Bernstein Theorem

1. Exercise 2.3.21
Give an explicit formula for a function from the set of integers to the set of positive integers
f : Z → Z+ that is:
a) one-to-one, but not onto

b) onto, but not one-to-one

c) one-to-one and onto

d) neither one-to-one nor onto

2. Exercise 2.3.37
If f and f ◦ g are onto, does it follow that g is onto? Justify your answer.

1
3. Exercise 2.3.72
Suppose that f is an invertible function from Y to Z and g is an invertible function from X
to Y . Show that the inverse of the composition f ◦ g is given by (f ◦ g)−1 = g −1 ◦ f −1 .

4. Not in Book - One-to-one and Onto


Prove or disprove the following.
1
a) f : R −→ R, f (x) = x2 +1
is onto
b) f : R −→ R, f (x) = |3x + 1| is one-to-one

5. Exercise 2.4.13 (b,d,f )


Is the sequence {an } a solution of the recurrence relation an = 8an−1 − 16an−2 if
b) an = 1
d) an = 4n
f) an = 2 · 4n + 3n4n

6. Exercise 2.4.17 (a,c)


Find the solution to each of these recurrence relations and initial conditions. Use an iterative
approach such as that used in Example 10.
a) an = 3an−1 , a0 = 2
c) an = an−1 + n, a0 = 1

7. Exercise 2.4.35
Show that nj=1 (aj − aj−1 ) = an − a0 , where a0 , a1 , ..., an is a sequence of real numbers.
P
This type of sum is called telescoping.

8. Not in Book
Find the value of each of these sums.
6
((−1)k − 1k )
P
a)
k=0

6
(1281/k − 1281/(k+1) )
P
b)
k=1

2
n
(3k 2 + k + 2)
P
c)
k=1

9. Exercise 2.5.2 (a,c,d,e)


Determine whether each of these sets is finite, countably infinite, or uncountable. For those
that are countably infinite, exhibit a one-to-one correspondence between the set of positive
integers and that set.
a) the integers greater than 10
c) the integers with absolute value less than 1,000,000
d) the real numbers between 0 and 2
e) the set A × Z+ where A = {2, 3}

10. Exercise 2.5.11


Give an example of two uncountable sets A and B such that A ∩ B is
a) finite
b) countably infinite
c) uncountably infinite

You might also like