commit 4d4fe0dd600b127c01cc013ec8067acdb8a4548f
parent 8336cb0ab6c3e5ac0144d96d5083a4f3dc866bfc
Author: Andrew <andrewlaack1@gmail.com>
Date: Thu, 29 Aug 2024 14:44:45 -0500
Took some notes today
Diffstat:
6 files changed, 24 insertions(+), 4 deletions(-)
diff --git a/Calculus.md b/Calculus.md
@@ -23,6 +23,9 @@ Khan Calc 2:
Unit 1:
- [[FundamentalTheroemofCalculus.md]]
+Unit 2:
+ - U-substitution
+
Calculus Early Transcendentals JS:
Section 2.8:
@@ -48,4 +51,3 @@ csc(x)cot(x) -> -csc(x) + c
csc^2(x) -> -cot(x) + c
---
-
diff --git a/DiscreteMath.md b/DiscreteMath.md
@@ -102,4 +102,7 @@ Unit 2.4 (integers and division):
- [CongruenceClass](CongruenceClass.md)
- [CaesarCipher](CaesarCipher.md)
- [VigenereCipher](VigenereCipher.md)
+ - [EuclideanAlgorithm](EuclideanAlgorithm.md)
+ - linear combination
+ - linear congruence
-
diff --git a/EuclideanAlgorithm.md b/EuclideanAlgorithm.md
@@ -0,0 +1,10 @@
+:discrete:
+# Euclidean Algorithm
+
+Ch 2.4
+
+## Notes
+
+**Definition:** The Euclidean algorithm is an algorithm used to determine the greatest common factor of two numbers.
+
+This is done as an alternative to the prime factoziation method which is too slow.
diff --git a/LinearAlgebra.md b/LinearAlgebra.md
@@ -17,6 +17,7 @@ Chapter 1:
- [Subspace](Subspace.md)
- [SumOfVectorSpaces](SumOfVectorSpaces.md)
- [DirectSum](DirectSum.md)
+ -
Khan Academy:
diff --git a/MachineLearning.md b/MachineLearning.md
@@ -36,9 +36,8 @@ Ch 2:
- [[Inference.md]]
- [[Prediction.md]]
-Elements of Statistical Learning:
-
-NOT STARTED
+Math for Machine Learning:
+ -
ML Categories:
diff --git a/StatisticsAndProbability.md b/StatisticsAndProbability.md
@@ -33,6 +33,11 @@ Chapter 1.3:
- [DistinguishablePermutation](DistinguishablePermutation.md)
- [MultinomialCoefficient](MultinomialCoefficient.md)
+Chapter 1.4:
+ - Conditional Probability
+ - independent events
+ -
+
---
[[Probability.md]]