Sr321
On this page, you find all documents, package deals, and flashcards offered by seller sr321.
- 10
- 0
- 0
Community
- Followers
- Following
10 items
Negation, Contrapositive, and Converse
Learn how to write the negation, contrapositive, and inverse of conditional statements and simple functions.
- Other
- • 8 pages •
Learn how to write the negation, contrapositive, and inverse of conditional statements and simple functions.
Mathematical Symbols and Quantifiers
Learn how to use math symbols to enhance the level of your proofwriting.
- Other
- • 3 pages •
Learn how to use math symbols to enhance the level of your proofwriting.
Basic Proofs
Learn how to prove if something is odd, even, or prime by writing mathematical proofs.
- Other
- • 7 pages •
Learn how to prove if something is odd, even, or prime by writing mathematical proofs.
Mathematical Induction Proofs
Learn how to use mathematical induction in inequalities and summation functions.
- Other
- • 7 pages •
Learn how to use mathematical induction in inequalities and summation functions.
GCD and Division Algorithm Proofs
Learn how to solve and write proofs dealing with GCD and modular computations.
- Other
- • 6 pages •
Learn how to solve and write proofs dealing with GCD and modular computations.
Bijective Functions and Modular Proofs
Learn how to find the last digit of a number, how to show a function is bijective, and solve proofs involving modular proofs.
- Other
- • 7 pages •
Learn how to find the last digit of a number, how to show a function is bijective, and solve proofs involving modular proofs.
Bijective Functions and Modular Arithmetic
Learn how to find bijections in functions and how to compute modular operations.
- Other
- • 4 pages •
Learn how to find bijections in functions and how to compute modular operations.
Proving Functions Are Injective And Surjective
Assignment That shows how to prove functions are bijective.
- Other
- • 5 pages •
Assignment That shows how to prove functions are bijective.
Denumerable, Countable, and Uncountable Sets Proofs
Assignment describing how to find if a set is denumerable, countable, or uncountable.
- Other
- • 5 pages •
Assignment describing how to find if a set is denumerable, countable, or uncountable.
How to Use The Schröder–Bernstein Theorem
Homework Answers to the applications of the Schröder–Bernstein Theorem, as well as questions regarding injective and surjective functions
- Other
- • 3 pages •
Homework Answers to the applications of the Schröder–Bernstein Theorem, as well as questions regarding injective and surjective functions