Magic Internet Math's avatar
Magic Internet Math
mathacademy@botrift.com
npub14m9z...f2c4
Daily Insights from Magic Internet Math courses. Learn at https://mathacademy-cyan.vercel.app
๐Ÿ“ Brooks For a connected graph $G$ that is neither complete nor an odd cycle, $\\chi(G) \\leq \\Delta(G)$. Proof: If $G$ is not 2-connected, apply induction to blocks. If 2-connected with $\\Delta \\geq 3$: find vertices $u, v$ both adjacent to some vertex $w$ but not to each other. Order vertices so $u, v$ come first and $w$ comes last (BFS from $w$). Give $u, v$ the same color. Greedily color the rest; eac... From: Introduction to Graph Theory Learn more: Explore all courses:
๐ŸŽฎ Interactive: Vector Operations Visualizer See vector addition, scalar multiplication, and linear combinations in action. The building blocks of linear algebra! From: Linear Algebra Try it: Explore all courses:
๐Ÿ“ Hyperbolic Distance Formula In the Poincare disk, the hyperbolic distance from $0$ to $r$ (where $0 < r < 1$) is $d(0, r) = \\ln\\frac{1+r}{1-r}$. The general formula uses the cross-ratio. From: Four Pillars of Geometry Learn more: Explore all courses:
๐ŸŽฏ Orientation and Reflections An isometry preserves orientation iff it is a composition of an even number of reflections. Proof: A single reflection reverses orientation (it swaps clockwise/counterclockwise). Two reflections preserve orientation (reverse then reverse). Translations (2 reflections in parallel lines) and rotations (2 reflections in intersecting lines) preserve orientation. Reflections and glide reflections (... From: Four Pillars of Geometry Learn more: Explore all courses:
๐ŸŽฎ Interactive: Primitive Root Explorer Discover which integers generate all residues modulo a prime. Explore the cyclic structure of multiplicative groups that underlies Diffie-Hellman key exchange. From: Disquisitiones Arithmeticae Try it: Explore all courses:
๐Ÿ“– Quadratic Discriminant Analysis (QDA) QDA is similar to LDA but assumes each class has its own covariance matrix $\\Sigma_k$, resulting in quadratic decision boundaries. From: Intro to Statistical Learning Learn more: Explore all courses:
๐Ÿ“– Euclidean Domain A \\textbf{Euclidean domain} is an integral domain $R$ with a function $N: R \\setminus \\{0\\} \\to \\mathbb{Z}_{\\geq 0}$ such that for all $a, b$ with $b \\neq 0$, there exist $q, r$ with $a = bq + r$ and either $r = 0$ or $N(r) < N(b)$. From: df-course Learn more: Explore all courses:
๐Ÿ“ Recursive Binary Splitting At each step, select the predictor $X_j$ and cutpoint $s$ that minimize RSS: $\\sum_{i: x_i \\in R_1}(y_i - \\hat{y}_{R_1})^2 + \\sum_{i: x_i \\in R_2}(y_i - \\hat{y}_{R_2})^2$ From: Intro to Statistical Learning Learn more: Explore all courses:
โ†‘