Name: _______________________________________________ Activity: _________________________
Section: _____________________________________________ Date: ___________________________
Instructions:
1. Show all your work; partial credit may be awarded.
2. Verification can be done using examples, computations, or small tables.
3. Write your answers clearly.
4. Collaborations are not allowed.
Part / Task Points Criteria / Notes
3 pts – Correct modulo computations (1 pt each)
Part A: Modular
6 3 pts – Verification of using 2 examples (1.5 pts
Arithmetic (6 pts)
each example, clear check)
f(x) = 2x+3: 5 pts total
- Domain and range correctly identified – 1 pt
Part B: Functions - Verification of one-to-one and onto – 2 pts (1 pt each for valid examples)
and Relations 10 - Inverse function and check – 2 pts (1 pt per verified value)
(10 pts) g(x) = x²: 5 pts total
- Verification of injectivity/surjectivity – 2 pts
- Domain restriction and verification – 3 pts
R (mod 4): 4 pts
- Reflexive, symmetric, transitive verified – 3 pts (1 pt each)
Part C: Equivalence
8 - Equivalence classes listed correctly – 1 pt ~ relation: 4 pts
Relations (8 pts)
- Reflexive, symmetric, transitive verified – 3 pts (1 pt each)
- Example of equivalence class – 1 pt
Part D: Function
- Compute correctly – 3 pts (1.5 pt each)
Composition 6
- Verification with 2 values for equality – 3 pts (1.5 pt per value)
Verification (6 pts)
Instructions:
1. Show all your work. Partial credit may be awarded.
2. Verify properties using examples or computations.
3. Write your answers clearly and logically.
4. Collaborations are not allowed.
Part A: Modular Arithmetic (10 points)
1. (3 pts) Compute the following modulo operations:
(
2. (7 pts) Verification: Show with examples that if . Use at least 2 different
sets of integers.
Part B: Functions and Relations (15 points)
1. (7 pts) Let be defined as (
a) Determine the domain and range of .
b) Verify if is one-to-one and onto by testing a few values.
c) Find the inverse function ( ( and verify ( ( for 2 values.
2. (8 pts) Let be defined as (
a) Verify if is injective or surjective by checking examples.
b) Suggest a restriction on the domain of so that it becomes a one-to-one correspondence, and verify with
examples.
Part C: Equivalence Relations (10 points)
1. (5 pts) Define a relation by .
a) Verify with examples that is reflexive, symmetric, and transitive.
b) List the equivalence classes of ({0,1,2,3,4,5,6,7}) under .
2. (5 pts) Let be a relation on (
a) Verify with examples that ~ is reflexive, symmetric, and transitive.
b) Give an example of an equivalence class.
Part D: Problem-Solving and Verification (15 points)
1. (7 pts) Given functions ( (
a) Compute ( ( (
b) Verify if by testing 2 values.
2. (8 pts) Let
using examples.