17:02 How To Create Your Own Obsidian Plugin - Step By Step Florian Ludewig 30.3K views - 2 years ago
16:52 How To Make Your Builds And Test Extremely Fast With Bazel Florian Ludewig 5.4K views - 2 years ago
8:40 Easily Build Beautiful Emails with Tailwind CSS and Dynamic Content Florian Ludewig 11.5K views - 3 years ago
7:39 Debugging Node.js + Typescript Running inside Docker Containers with Hot Reload Florian Ludewig 12.9K views - 4 years ago
11:12 The Easiest Way to Run Integration Tests with Docker and Testcontainers Florian Ludewig 6.8K views - 4 years ago
41:10 Fullstack Authentication with Refresh Access Tokens (Node, Next.js, Typescript) Florian Ludewig 34K views - 4 years ago
2:11 Finding Supremum and Infiumum of the Division Relation fo Two Natural Numbers Florian Ludewig 573 views - 6 years ago
2:27 Showing that the Infimum of {X,Y} Exists in the Partial Order [ Ƥ(M), ⊆ ] Florian Ludewig 344 views - 6 years ago
6:08 Proof of the Associativity of the Supremum (Sup{ Sup{ a, b }, c } = Sup{ a, Sup{ b, c } }) Florian Ludewig 430 views - 6 years ago
5:11 Proofing that R is an equivalence relation if and only if IdM ⊆ R and R⚬R^-1 ⊆ R Florian Ludewig 473 views - 6 years ago
1:40 If the Relation R is Symmetric and Anti-Symmetric then R is also Transitive Florian Ludewig 956 views - 6 years ago
1:47 Proof the Equivalence of (R⚬S)^-1 = R^-1⚬R^-1 (Relation Product) Florian Ludewig 931 views - 6 years ago
2:29 Proof of the Associativity of the Relation Product (R⚬S)⚬T = R⚬(S⚬T) Florian Ludewig 826 views - 6 years ago
3:37 Proof that the Divisibility is a Partial Order (Reflexive, Anti-Symmetric, Transitive) Florian Ludewig 4.4K views - 6 years ago
5:37 Proof that Congruence Modulo is an Equivalence Relation (Reflexive, Symmetric, Transitive) Florian Ludewig 5.4K views - 6 years ago
3:23 Proofing Equivalence of Four Statements (Logical Conclusion) Florian Ludewig 261 views - 6 years ago
5:46 Proving the Equivalence of Statements (Logical Conclusion) Florian Ludewig 336 views - 6 years ago
1:46 If (F ⟶ G) is a Tautology and F is Satisfiable, Then G is Also Satisfiable Florian Ludewig 537 views - 6 years ago
3:01 If (F ⟶ G) is Satisfiable and F is Satisfiable, Then G is Also Satisfiable? Florian Ludewig 757 views - 6 years ago
1:32 If (F ⟶ G) is a Tautology and F is a Tautology Then G is Also a Tautology? Florian Ludewig 478 views - 6 years ago
2:55 Finding the Boolean Function for a Large Logical Statement Florian Ludewig 224 views - 6 years ago
1:35 Finding All Vectors that are Orthogonal to a Vector in the 3-Dimensional Space Florian Ludewig 1.2K views - 6 years ago
2:36 Proving that an Orthogonal Set of Vectors is a Subspace of a Euclidean Space Florian Ludewig 480 views - 6 years ago
8:42 Orthonormalization of Vectors Using the Gram Schmidt Process (Orthogonalization + Normalization) Florian Ludewig 3.2K views - 6 years ago
5:59 Two Vectors are Linearly Independent if and only if their Cross Product is Not the Zero Vector Florian Ludewig 1.4K views - 6 years ago
3:36 Showing the Equivalence of the Triple Scalar Product and the Determinant Florian Ludewig 268 views - 6 years ago
4:07 Proof that { {x}, {x, y} } = { {a}, {a, b} } if and only if x = a and y = b Florian Ludewig 567 views - 6 years ago
5:35 Proof of A △ (B △ C) = (A △ B) △ C (Associativity of the Symmetric Difference) Florian Ludewig 35.4K views - 6 years ago
4:41 If b1 * b2 * ... * bn = 1 Then b1 + b2 + ... bn is Bigger or Equal than n (Proof by Induction) Florian Ludewig 518 views - 6 years ago
4:15 Power Set of a Set With n Elements has 2^n Elements (Proof by Induction) Florian Ludewig 23.4K views - 6 years ago
6:33 Proof that (P(A) △ P(B)) ∩ P(A △ B) = ∅ and A = B are Equivalent Florian Ludewig 501 views - 6 years ago
2:25 Proof that A = B is Equivalent to (A ∩ !B) ∪ (!A ∩ B) = ∅ Florian Ludewig 479 views - 6 years ago
2:40 Showing that a Point Divides a Line in the Golden Ratio on a Triangle Florian Ludewig 322 views - 6 years ago
2:25 Proofing a Sum of the Fibonacci Sequence Without Induction Florian Ludewig 1.1K views - 6 years ago
4:21 Proof F(m+n) = F(m+1) * F(n) + F(m) * F(n-1) by Induction (Fibonacci Sequence) Florian Ludewig 3.5K views - 6 years ago
4:16 Proof F(2n) = F(n)*(F(n+1) + F(n-1)) Using the BINET's Formula Florian Ludewig 2.3K views - 6 years ago
3:18 Check if a Matrix is Diagonalizable with Curve Sketching Florian Ludewig 169 views - 6 years ago