Articles containing proofs | Lemmas in number theory | Quadratic residue | Squares in number theory | Permutations
In number theory, Zolotarev's lemma states that the Legendre symbol for an integer a modulo an odd prime number p, where p does not divide a, can be computed as the sign of a permutation: where ε denotes the signature of a permutation and πa is the permutation of the nonzero residue classes mod p induced by multiplication by a. For example, take a = 2 and p = 7. The nonzero squares mod 7 are 1, 2, and 4, so (2|7) = 1 and (6|7) = −1. Multiplication by 2 on the nonzero numbers mod 7 has the cycle decomposition (1,2,4)(3,6,5), so the sign of this permutation is 1, which is (2|7). Multiplication by 6 on the nonzero numbers mod 7 has cycle decomposition (1,6)(2,5)(3,4), whose sign is −1, which is (6|7). (Wikipedia).
Why did they prove this amazing theorem in 200 different ways? Quadratic Reciprocity MASTERCLASS
The longest Mathologer video ever, just shy of an hour (eventually it's going to happen :) One video I've been meaning to make for a long, long time. A Mathologerization of the Law of Quadratic Reciprocity. This is another one of my MASTERCLASS videos. The slide show consists of 550 slides
From playlist Recent videos
Why every vector space (not necessarily finite dimensional) has a basis, feat. Zorn's Lemma and the actual definition of a basis Check out my set theory playlist: Set theory https://www.youtube.com/playlist?list=PLJb1qAQIrmmDr_RYAtqY1MNgTgVNMJNIf Check out my vector space playlist: https
From playlist Vector Spaces
Zorn's Lemma, The Well-Ordering Theorem, and Undefinability | Nathan Dalaklis
Zorn's Lemma and The Well-ordering Theorem are seemingly straightforward statements, but they give incredibly mind-bending results. Orderings, Hasse Diagrams, and the Ordinals will come up in this video as tools to get a better view of where the proof of Zorn's lemma comes from. ***Corre
From playlist The First CHALKboard
Linear Algebra Proofs 15b: Eigenvectors with Different Eigenvalues Are Linearly Independent
https://bit.ly/PavelPatreon https://lem.ma/LA - Linear Algebra on Lemma http://bit.ly/ITCYTNew - Dr. Grinfeld's Tensor Calculus textbook https://lem.ma/prep - Complete SAT Math Prep
From playlist Part 3 Linear Algebra: Linear Transformations
Markoff surfaces and strong approximation - Alexander Gamburd
Special Seminar Topic: Markoff surfaces and strong approximation Speaker: Alexander Gamburd Affiliation: The Graduate Center, The City University of New York Date: December 8, 2017 For more videos, please visit http://video.ias.edu
From playlist Mathematics
Probability & Statistics in Finance
Mathematica 8 provides a suite of high-level functions for probability and statistics. New capabilities include the ability to compute the probability of any event or the expectation of any expression, simulate any distribution, and automatically estimate parameters or test goodness of fit
From playlist Wolfram Technology Conference 2010
This course is on Lemma: http://lem.ma Lemma looking for developers: http://lem.ma/jobs Other than http://lem.ma, I recommend Strang http://bit.ly/StrangYT, Gelfand http://bit.ly/GelfandYT, and my short book of essays http://bit.ly/HALAYT Questions and comments below will be prompt
From playlist Problems, Paradoxes, and Sophisms
Linear Algebra Vignette 2d: RREF And The Inverse Matrix
This course is on Lemma: http://lem.ma Lemma looking for developers: http://lem.ma/jobs Other than http://lem.ma, I recommend Strang http://bit.ly/StrangYT, Gelfand http://bit.ly/GelfandYT, and my short book of essays http://bit.ly/HALAYT Questions and comments below will be prompt
From playlist Linear Algebra Vignettes
Linear Algebra 18b: A Worked out Eigenvalue Decomposition Example
https://bit.ly/PavelPatreon https://lem.ma/LA - Linear Algebra on Lemma http://bit.ly/ITCYTNew - Dr. Grinfeld's Tensor Calculus textbook https://lem.ma/prep - Complete SAT Math Prep
From playlist Part 3 Linear Algebra: Linear Transformations
Doing Probability with Mathematica
To learn more about Wolfram Technology Conference, please visit: https://www.wolfram.com/events/technology-conference/ Speaker: Nassim Nicholas Taleb Wolfram developers and colleagues discussed the latest in innovative technologies for cloud computing, interactive deployment, mobile devi
From playlist Wolfram Technology Conference 2018
This course is on Lemma: http://lem.ma Lemma looking for developers: http://lem.ma/jobs Other than http://lem.ma, I recommend Strang http://bit.ly/StrangYT, Gelfand http://bit.ly/GelfandYT, and my short book of essays http://bit.ly/HALAYT Questions and comments below will be prompt
From playlist Problems, Paradoxes, and Sophisms
Burnside's Lemma (Part 2) - combining math, science and music
Part 1 (previous video): https://youtu.be/6kfbotHL0fs Orbit-stabilizer theorem: https://youtu.be/BfgMdi0OkPU Burnside's lemma is an interesting result in group theory that helps us count things with symmetries considered, e.g. in some situations, we don't want to count things that can be
From playlist Traditional topics, explained in a new way
Graph regularity and counting lemmas - Jacob Fox
Conference on Graphs and Analysis Jacob Fox June 5, 2012 More videos on http://video.ias.edu
From playlist Mathematics
Regularity methods in combinatorics, number theory, and computer science - Jacob Fox
Marston Morse Lectures Topic: Regularity methods in combinatorics, number theory, and computer science Speaker: Jacob Fox Affiliation: Stanford University Date: October 24, 2016 For more videos, visit http://video.ias.edu
From playlist Mathematics
This lecture is part of an online course on the Zermelo Fraenkel axioms of set theory. This lecture gives an overview of the axioms, describes the von Neumann hierarchy, and sketches several approaches to interpreting the axioms (Platonism, von Neumann hierarchy, multiverse, formalism, pra
From playlist Zermelo Fraenkel axioms
9. Szemerédi's graph regularity lemma IV: induced removal lemma
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Prof. Zhao explains a strengthening of the graph regulari
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
6. Szemerédi's graph regularity lemma I: statement and proof
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Szemerédi's graph regularity lemma is a powerful tool in
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019
A stable arithmetic regularity lemma in finite (...) - C. Terry - Workshop 1 - CEB T1 2018
Caroline Terry (Maryland) / 01.02.2018 A stable arithmetic regularity lemma in finite-dimensional vector spaces over fields of prime order In this talk we present a stable version of the arithmetic regularity lemma for vector spaces over fields of prime order. The arithmetic regularity l
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
Set Theory (Part 2): ZFC Axioms
Please feel free to leave comments/questions on the video and practice problems below! In this video, I introduce some common axioms in set theory using the Zermelo-Fraenkel w/ choice (ZFC) system. Five out of nine ZFC axioms are covered and the remaining four will be introduced in their
From playlist Set Theory by Mathoma
7. Szemerédi's graph regularity lemma II: triangle removal lemma
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62qauV_CpT1zKaGG_Vj5igX Continuing the discussion of Szemerédi's graph regularity
From playlist MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019