Surfaces | Theorems in topology
In mathematics, the bagpipe theorem of Peter Nyikos describes the structure of the connected (but possibly non-paracompact) ω-bounded surfaces by showing that they are "bagpipes": the connected sum of a compact "bag" with several "long pipes". (Wikipedia).
Bayes' Theorem - The Simplest Case
►Second Bayes' Theorem example: https://www.youtube.com/watch?v=k6Dw0on6NtM ►Third Bayes' Theorem example: https://www.youtube.com/watch?v=HaYbxQC61pw ►FULL Discrete Math Playlist: https://www.youtube.com/watch?v=rdXw7Ps9vxc&list=PLHXZ9OQGMqxersk8fUxiUMSIx0DBqsKZS Bayes' Theorem is an inc
From playlist Discrete Math (Full Course: Sets, Logic, Proofs, Probability, Graph Theory, etc)
Number Theory | Lagrange's Theorem of Polynomials
We prove Lagrange's Theorem of Polynomials which is related to the number of solutions to polynomial congruences modulo a prime.
From playlist Number Theory
Proof: The Isosceles Triangle Theorem
Complete videos list: http://mathispower4u.yolasite.com/ This video provides a two column proof of the isosceles triangle theorem.
From playlist Triangles and Congruence
Calculus - The Fundamental Theorem, Part 1
The Fundamental Theorem of Calculus. First video in a short series on the topic. The theorem is stated and two simple examples are worked.
From playlist Calculus - The Fundamental Theorem of Calculus
Captured Tanks - Bagpipers I OUT OF THE TRENCHES
Indy sits in the chair of wisdom again to answer your questions about World War 1. » HOW CAN I SUPPORT YOUR CHANNEL? You can support us by sharing our videos with your friends and spreading the word about our work.You can also support us financially on Patreon: https://www.patreon.com/th
From playlist All Videos from THE GREAT WAR - chronological order
First Theorem of Directed Graphs | Digraph Theory
The first theorem of graph theory tells us that the degree sum of a graph is two times the number of edges, or two times its size. A similar theorem is true in directed graph theory, or digraph theory. This theorem states that the sum of the outdegrees of the vertices in a digraph equals t
From playlist Graph Theory
This video states and investigates the triangle inequality theorem. Complete Video List: http://www.mathispower4u.yolasite.com
From playlist Relationships with Triangles
Fibonacci Tartan and Bagpipes - Numberphile
See Brady's blog about the tartan: http://bit.ly/Yy7ieP Free audiobook: http://www.audible.com/numberphile More links & stuff in full description below ↓↓↓ The Fibonacci tartan would not have been possible without the good people at http://www.houseoftartan.com/ - check their website and
From playlist Golden Ratio on Numberphile
Theory of numbers: Congruences: Euler's theorem
This lecture is part of an online undergraduate course on the theory of numbers. We prove Euler's theorem, a generalization of Fermat's theorem to non-prime moduli, by using Lagrange's theorem and group theory. As an application of Fermat's theorem we show there are infinitely many prim
From playlist Theory of numbers
[Space News] Nov 16-22, 2015 in Weekends with What Da Math
Hello and welcome to Weekends with What Da Math! This is a vlog that will focus on weekly news related to space/math/science and will answer questions that you have as well. I'm also going to talk about other fun stuff. Enjoy and please subscribe Here are the links: The new US bill tha
From playlist Weekends with What Da Math
Victory March Of The 51st Highland Division (1945) | British Pathé
This footage from 1945 shows Scotland's 51st Highland Division marching through Bremerhaven, Germany with bagpipes blaring after the allied victory of World War II. For Archive Licensing Enquiries Visit: https://goo.gl/W4hZBv Explore Our Online Channel For FULL Documentaries, Fascinating
From playlist British Pathé | Explore the Archive
Mathematical Music - Numberphile Interview
Alan's album on iTunes: http://bit.ly/1sdwTHF More links & stuff in full description below ↓↓↓ Links to videos mentioned are below. Alan Stewart makes music for many of Brady's videos, including here on Numberphile. In this video he explains some of his compositions. SOME VIDEOS MENTION
From playlist Numberphile Videos
Scotland: Royal Braemar (1928)
EMPIRE NEWS NEWSREEL (REUTERS) To license this film, visit https://www.britishpathe.com/video/VLVACJ7VEFSZ48A6NYDJEF1PIGA1O-SCOTLAND-ROYAL-BRAEMAR Royal carriage arrives at Braemar gathering / Various shots of Highland games. Full Description: SLATE CARD INFORMATION: Royal Braemar SC
From playlist EMPIRE NEWS NEWSREEL (REUTERS)
DEFENCE: London Scottish in the Highlands (1929)
EMPIRE NEWS NEWSREEL (REUTERS) To license this film, visit https://www.britishpathe.com/video/VLVA284PELULMWQGVMTQSTVDPGDI9-DEFENCE-LONDON-SCOTTISH-IN-THE-HIGHLANDS London Scottish, a regiment of the British Territorial Army, in the Scottish Highlands. Full Description: SLATE INFORMAT
From playlist EMPIRE NEWS NEWSREEL (REUTERS)
Item title reads - Edinburgh Festival. Scotland. L/S Edinburgh Castle, pan to M/S Princes Street. Back view two Scotsmen wearing kilts walking along Princes Street. M/S people looking in the Tartan Shop. M/S sign "Kilts 69/6" M/S Mr and Mrs Hummel with children from Washington D.C.
From playlist Edinburgh Festival
Joe Neeman: Gaussian isoperimetry and related topics II
The Gaussian isoperimetric inequality gives a sharp lower bound on the Gaussian surface area of any set in terms of its Gaussian measure. Its dimension-independent nature makes it a powerful tool for proving concentration inequalities in high dimensions. We will explore several consequence
From playlist Winter School on the Interplay between High-Dimensional Geometry and Probability
Outtakes #2: Crash Course Computer Science
In which lines will be flubbed and punches thrown - but don't worry, we'll be back to your regular scheduled Comp Sci next week! Pre-order our limited edition Crash Course: Computer Science Floppy Disk Coasters here! https://store.dftba.com/products/computer-science-coasters Produced in
From playlist Bloopers & Outtakes
Intro to Menger's Theorem | Graph Theory, Connectivity
Menger's theorem tells us that for any two nonadjacent vertices, u and v, in a graph G, the minimum number of vertices in a u-v separating set is equal to the maximum number of internally disjoint u-v paths in G. The Proof of Menger's Theorem: https://youtu.be/2rbbq-Mk-YE Remember that
From playlist Graph Theory
Graph Theory: 09. Graph Isomorphisms
In this video I provide the definition of what it means for two graphs to be isomorphic. I illustrate this with two isomorphic graphs by giving an isomorphism between them, and conclude by discussing what it means for a mapping to be a bijection. An introduction to Graph Theory by Dr. Sar
From playlist Graph Theory part-2
NOTACON 5: HICK Tech: The Rural Technology Experience
Speaker: Emma Hogbin HICK Tech is a new way of thinking about how technology affects communities and how communities affect technology. In 2007 HICK Tech launched its first-ever rural technology conference. An unexpected audience arrived for the conference: technology end-users wanted to
From playlist Notacon 5