vault backup: 2026-03-09 18:38:49

.obsidian/workspace.json

@@ -41,7 +41,7 @@
             "state": {
               "type": "markdown",
               "state": {
-                "file": "Counting.md",
+                "file": "DAS/Counting.md",
                 "mode": "source",
                 "source": false
               },
@@ -208,10 +208,10 @@
       "obsidian-git:Open Git source control": false
     }
   },
-  "active": "d840acc1de60406b",
+  "active": "7a0e7b37bd89861d",
   "lastOpenFiles": [
     "DAS/Functions.md",
-    "Counting.md",
+    "DAS/Counting.md",
     "DAS/Relations.md",
     "DAS/Logic.md",
     "DAS/Set Theory.md",

DAS/Counting.md

@@ -25,6 +25,13 @@ $$
 Formula: $"Elements that are" x^2 + "Elements that are" x^5 - "Elements that are both"$
 $==> 1,000 + 15 - 3 = 1,012$
 
+### For two sets
+$|"Total possibilities"| - |"Avoid 1"| - |"Avoid 2"| + |"Avoid Both"|$
+Where 
+- $"Avoid 1"$ are all elements *not matching* condition 1
+- $"Avoid 2"$ are all elements *not matching* condition 2
+- $"Avoid Both"$ are all elements *not matching* condition 1 **and** 2
+
 ## Type of Task: Boolean Lattice
 Find the amount of upper bounds in ${0, 1}^5$ for the set of vectors $S = {x, y, z}$
 $$