302.S1: Three Paths to Irreducibility
Gauss' Lemma, Eisenstein's Criterion, and Reduction Modulo N can each help us decide which polynomials are irreducible over the rationals.
▶︎
302.10A: Fields, Multiplication, and Fractions
▶︎
302.S4: Normal Extensions
▶︎
302.S3a: Motivation for Minimal Polynomials
▶︎
302.S3c: Minimal Polynomials Existence and Uniqueness
▶︎
Why Aliens Would NEVER Invade Africa
▶︎
302.S12B: Quintic Impossible 2 - An Insolvable Quintic
▶︎
From Child Prodigy to Winning Fields Medal, Nobel of Math
▶︎
The Strangest Things that Correlate with IQ
▶︎
Knife Expert: Real Knife Defense Is TERRIFYING
▶︎
You Know This Song (but the Orchestra Doesn’t) | Jacob Collier & VSO School of Music Orchestra | TED
▶︎
The Greatest Mathematician of Our Time
▶︎
Why Do Predators Ignore Sleeping Humans?
▶︎
Visual Group Theory, Lecture 6.3: Polynomials and irreducibility
▶︎
Judge Can’t Stop Laughing At Sovereign Citizen’s Courtroom Meltdown!!!
▶︎
My Golden Retriever Heals a Terrified Rescue Kitten in Just 3 Meetings!
▶︎
When Math Isn’t Based in Reality
▶︎
Irreducible Polynomials
▶︎
NERVOUS 12-Year-Old Who Can Sing Without Opening Her Mouth Earns Mel B's GOLDEN BUZZER!
▶︎