notes

commit a2aeb33018acbda34f3ac8b604146e26fa9d0ab0
parent 4e2ad344b7d1db8f730e2016882f964f58df5111
Author: Andrew <andrewlaack1@gmail.com>
Date:   Mon, 29 Apr 2024 09:41:43 -0500

Completed W13 notes am

Diffstat:
M
Math310.md
 | 
1
+
A
Partition.md
 | 
9
+++++++++

2 files changed, 10 insertions(+), 0 deletions(-)
diff --git a/Math310.md b/Math310.md
@@ -17,3 +17,4 @@ This is the index for my main Math 310 notes.
 [[ProveSetEquality.md]]
 [[PerfectNumbers.md]]
 [[GaussianIntegers.md]]
+[[Partition.md]]
diff --git a/Partition.md b/Partition.md
@@ -0,0 +1,9 @@
+# Partition
+
+AM W14 Reading
+
+## Notes
+
+**Definition:** A partition of a set A is a set of non-empty subsets of A, such that the union of all the subsets equals A, and the intersection of any two different subsets is the null set. 
+
+Basically, a partition is the subsets of a set where all subsets together make the original set and all subsets are unique in their elements where any intersection between them is the null set. Keep in mind the partition is the combination of all of them not simply a singular one of the subsets which is where this diverges from the computational term "partition".