Difference between revisions of "Sets"
(→Assignment) |
(→Assignment) |
||
Line 3: | Line 3: | ||
=Assignment= | =Assignment= | ||
# Prove an identity. | # Prove an identity. | ||
− | ## Give a proof that the subseteq operator makes a partial order. Namely, prove that the subseteq operator is reflexive, antisymmetric, and transitive. When you need to use names for sets, use A, B, C in the proof. | + | ## Give a proof that the subseteq operator makes a partial order. Namely, prove that the subseteq operator is reflexive, antisymmetric, and transitive. When you need to use names for sets, use A, B, C in the proof. PROOF. |
− | ## Give a proof that set intersection is associative. When you need to use names for sets, use A, B, C in the proof. | + | ## Give a proof that set intersection is associative. When you need to use names for sets, use A, B, C in the proof. PROOF. |
# Basic questions about sets / basic reasoning / using the identities and rules for sets. | # Basic questions about sets / basic reasoning / using the identities and rules for sets. | ||
− | ## MCS Problem 15.4. | + | ## MCS Problem 15.4. What is the answer, you should come up with a formula, and explain why. |
− | ## MCS Problem 15.5 | + | ## MCS Problem 15.5. Make sure to only use set notation in part a. In part b, give a formula, also work it out, and explain. |
− | ## MCS Problem 15.9 | + | ## MCS Problem 15.9. Again, give formulas, explain why, work them out. ** most interesting problem. |
− | ## MCS Problem 15.13 | + | ## MCS Problem 15.13. Again, give formulas, explain why, work them out. |
− | ## MCS Problem 15.30 | + | ## MCS Problem 15.30. ** tied for most interesting. PROOF. |
− | ## MCS Problem 15.35 | + | ## MCS Problem 15.35. What is the answer for each, and explain why. |
Revision as of 14:47, 7 April 2023
An assignment in CS 303. Some problems are from MCS
Assignment
- Prove an identity.
- Give a proof that the subseteq operator makes a partial order. Namely, prove that the subseteq operator is reflexive, antisymmetric, and transitive. When you need to use names for sets, use A, B, C in the proof. PROOF.
- Give a proof that set intersection is associative. When you need to use names for sets, use A, B, C in the proof. PROOF.
- Basic questions about sets / basic reasoning / using the identities and rules for sets.
- MCS Problem 15.4. What is the answer, you should come up with a formula, and explain why.
- MCS Problem 15.5. Make sure to only use set notation in part a. In part b, give a formula, also work it out, and explain.
- MCS Problem 15.9. Again, give formulas, explain why, work them out. ** most interesting problem.
- MCS Problem 15.13. Again, give formulas, explain why, work them out.
- MCS Problem 15.30. ** tied for most interesting. PROOF.
- MCS Problem 15.35. What is the answer for each, and explain why.