diff --git a/00 Inbox/29622985 - 2026-04-28.md b/00 Inbox/29622985 - 2026-04-28.md
new file mode 100644
index 0000000..3ba28c7
--- /dev/null
+++ b/00 Inbox/29622985 - 2026-04-28.md	
@@ -0,0 +1,18 @@
+---
+created: 2026-04-28 14:25
+course:
+topic:
+related:
+type: lecture
+status: 🔴
+tags:
+  - university
+---
+## 📌 Summary
+
+> [!abstract]
+> 
+
+---
+
+## 📝 Content
diff --git a/10 Courses/01 - WiSe 2025_26/DAS/Formulas.md b/10 Courses/01 - WiSe 2025_26/DAS/Formulas.md
index 86657e4..0c65173 100644
--- a/10 Courses/01 - WiSe 2025_26/DAS/Formulas.md	
+++ b/10 Courses/01 - WiSe 2025_26/DAS/Formulas.md	
@@ -29,8 +29,7 @@ Result is the last $"Remainder"$ that is not $0$.
 **Goal:** find a $x$ and $y$ so that $"Divident" * x + "Divisor" * y = gcd("Dividend", "Divisor")$
 
 1. **Rewrite Euclid (above) equations** to solve for remainder ($"Remainder" = "Old Remainder" - "Dividend" * "Divisor"$)
-2.  **Substitute remainders** -> $$
-
+2.  **Substitute remainders** -> 
 ## Inclusion-Exclusion Principle
  Principle that dictates that when combining / overlapping sets, you have to make sure to not include elements that occur in multiple sets multiple times.
 
@@ -44,7 +43,7 @@ $$
 &15^5 = 759,375 && "--- in the range / below" 10^6 \
 &16^5 = 1,048,576 && "--- outside the range / above" 10^6 \
 &=> 15 "numbers in the form "x^5"exist" &&
-
+$$
 > [!warning]
 > Now, we can't add $1,000$ and $15$, since there are numbers that match both, so we need to subtract these duplicates.
 
diff --git a/Untitled 1.base b/Untitled 1.base
new file mode 100644
index 0000000..c6ab609
--- /dev/null
+++ b/Untitled 1.base	
@@ -0,0 +1,3 @@
+views:
+  - type: table
+    name: Table