251 - MATH 120 - Problem Set 6
251 - MATH 120 - Problem Set 6
Problem Set 6
Alfred Pennyworth
Due Monday, November 11th, 2024
Assignment Instructions
• These are to be written up in LATEX and turned in on Gradescope.
• Click here to duplicate this .tex file in Overleaf .
• Write your solutions inside the solution environment.
• You are always encouraged to talk problems through with your peers and your instructor, but your
write up should be done independently.
Statement on generative AI
In this and other mathematics courses, you are expected to construct clear and concise mathematical argu-
ments based on statements proven in our text and class notes. Large language models such as ChatGPT
are unable to produce this kind of solution. They also frequently generate circular logic and outright false
results.
You may use AI to summarise content, generate study plans, create problems, or do other study-related
activities. You may not ask a chatbot to solve your quiz or homework problems, or do any assessment-related
activities.
You may use AI tools to edit your grammar and punctuation, but remember that mathematical English
is not the same as academic English in other disciplines.
1
Problem 1
For each of the following functions, determine whether it is one-to-one and/or onto.
a) f : Z −→ Z where f (n) = n2 + 1.
(
n
if n is even
b) f : Z −→ Z where f (x) = 2 .
0 if n is odd
(
1
if x ̸= 0
c) f : R −→ R where f (x) = x .
0 if x = 0
(
2n if n is even
d) f : N −→ N where f (n) = .
n if n is odd
2
Problem 2
Let A = {1, 2, 3, 4} and B = {5, 6, 7}. Let f be the relation {(1, 5) , (2, 5) , (3, 6) , (x, y)}, where the values of
(x, y) are to be filled by you. Give an example of (x, y) ∈ A × B so that
a) The relation f is not a function.
b) The relation is a function from A to B but not onto B.
3
Problem 3
Let A be an n-element set and let i, j, k ∈ N with i + j + k = n. How many functions f : A −→ {0, 1, 2} are
there for which all three of the below are satisfied:
• a ∈ A f (a) = 0 = i,
• a ∈ A f (a) = 1 = j,
• a ∈ A f (a) = 2 = k.
4
Problem 4
You have 20 jellybeans and you want to eat all of the jellybeans over the course of 2 weeks. Suppose that
you eat at least one jellybean a day. Prove, using the pigeonhole principle, that there is a set of consecutive
days where you ate exactly 7 jellybeans.
5
Problem 5
Let A be a set of 10 distinct integers between 1 and 100, inclusive.
a) Use the pigeonhole principle to prove that there are two different non-empty subsets of A such that the
sum of their elements are the same.
b) Prove that there are two non-empty disjoint subsets of A such that the sum of their elements is the same.
6
Problem 6
Let A = x ∈ Z 3 | x . Show that A and N have the same cardinality.
Hint: Define a function f : A −→ N and show that it is a bijection.
7
Problem 7
Let f : A −→ B be a function. For any subset X of A we define
f (X) = f (x) x ∈ X .
8
Problem 8
Suppose A and B are non-empty sets and f : A −→ B and g : B −→ A are functions that satisfy g ◦ f = idA .
a) Is is necessarily true that f is surjective?
b) Is it necessarily true that g is injective?
c) Is it necessarily true that f ◦ g = idB ?