Transcendental numbers powered by Cantor's infinities
In today's video the Mathologer sets out to give an introduction to the notoriously hard topic of transcendental numbers that is both in depth and accessible to anybody with a bit of common sense. Find out how Georg Cantor's infinities can be used in a very simple and off the beaten track
From playlist Recent videos
Proof By Contradiction of Infinite Primes - A Level Maths
Another famous proof by contradiction! This time, we prove there are infinite primes! Euler was the guy to devise the proof of infinitely many primes and it's one of my favourite! Proof by contradiction for the PROOF CHAPTER of the NEW A Level Maths Year 2 for AQA, Edexcel, OCR and OCR M
From playlist PROOF BY CONTRADICYION A Level Maths
Use Fermat Numbers to Prove the Infinitude of Prime Numbers
Use Fermat Numbers to Prove the Infinitude of Prime Numbers Please Like, Share, and Subscribe! https://www.youtube.com/channel/UC5uV1LcSkHL5zCxKBikdTEg?sub_confirmation=1
From playlist Elementary Number Theory
Hillel Furstenberg - The Abel Prize interview 2020
00:00 Congratulations 00:30 Furstenberg tells us about his childhood and his love for mathematics 03:20 Enjoying problem-solving challenges 05:44 Being an undergraduate student at Yeshiva College and his paper "on the infinitude of primes" 08:27 PhD thesis at Princeton University proving
From playlist The Abel Prize Interviews
In this video, we explore the "pattern" to prime numbers. I go over the Euler product formula, the prime number theorem and the connection between the Riemann zeta function and primes. Here's a video on a similar topic by Numberphile if you're interested: https://youtu.be/uvMGZb0Suyc The
From playlist Other Math Videos
Prime Numbers and their Mysterious Distribution (Prime Number Theorem)
Primes are the building blocks of math. But just how mysterious are they? Our study of prime numbers dates back to the ancient Greeks who first recognized that certain numbers can't be turned into rectangles, or that they can't be factored into any way. Over the years prime numbers have
From playlist Prime Numbers
Prove that there is a prime number between n and n!
A simple number theory proof problem regarding prime number distribution: Prove that there is a prime number between n and n! Please Like, Share and Subscribe!
From playlist Elementary Number Theory
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
Abundant, Deficient, and Perfect Numbers ← number theory ← axioms
Integers vary wildly in how "divisible" they are. One way to measure divisibility is to add all the divisors. This leads to 3 categories of whole numbers: abundant, deficient, and perfect numbers. We show there are an infinite number of abundant and deficient numbers, and then talk abou
From playlist Number Theory
The Generalized Ramanujan Conjectures and Applications (Lecture 3) by Peter Sarnak
Lecture 3: Mobius Randomness and Horocycle Dynamics Abstract : The Mobius function mu(n) is minus one to the number of distinct prime factors of n if n has no square factors and zero otherwise. Understanding the randomness (often referred to as the "Mobius randomness principle") in this f
From playlist Generalized Ramanujan Conjectures Applications by Peter Sarnak
There are Infinitely many Primes! - Euclid's Proof of the Infinitude of Primes
GET 15% OFF EVERYTHING! THIS IS EPIC! https://teespring.com/stores/papaflammy?pr=PAPAFLAMMY Help me create more free content! =) https://www.patreon.com/mathable AC Playlist: https://www.youtube.com/watch?v=jmD1CWzHjzU&list=PLN2B6ZNu6xmdvtm_DdFUaHIK_VB84hG_m Today we are going to cover
From playlist Theory and Proofs
PMSP - Pseudorandomness of the Mobius function - Peter Sarnak
Peter Sarnak Princeton University and Institute for Advanced Study June 18, 2010 For more videos, visit http://video.ias.edu
From playlist Mathematics
Yves Benoist - Random walk on p-adic flag varieties
Yves Benoist (Université Paris Sud, France) According to a theorem of Furstenberg, a Zariski dense probability measure on a real semisimple Lie group admits a unique stationary probability measure on the flag variety. In this talk we will see that a Zariski dense probability measure on a
From playlist T1-2014 : Random walks and asymptopic geometry of groups.
The Abel Prize announcement 2020 — Hillel Furstenberg & Gregory Margulis
0:50 The Abel Prize announced by Hans Petter Graver, President of The Norwegian Academy of Science and Letters 1:37 Citation by Hans Munthe-Kaas, Chair of the Abel committee 9:28 Popular presentation of the prize winners work by Alex Bellos, British writer, and science communicator 16:21 I
From playlist Gregory Margulis
Number Theory | Infinitely many primes of the form 3n+1.
In our third and final video regarding the infinitude of primes of a certain form we us the notion of quadratic residues and quadratic reciprocity to prove there are infinitely many primes of the form 3n+1. http://www.michael-penn.net http://www.randolphcollege.edu/mathematics/
From playlist Number Theory
Furstenberg sets in finite fields - Zeev Dvir
Computer Science/Discrete Mathematics Seminar I Topic: Furstenberg sets in finite fields Speaker: Zeev Dvir Affiliation: Princeton University Date: October 28, 2019 For more video please visit http://video.ias.edu
From playlist Mathematics
Why Furstenberg and Margulis won the Abel Prize [Popular presentation]
On the work of Furstenberg and Margulis by Alex Bellos. Alex Bellos is a british writer, broadcaster and popularizer of mathematics. This clip is from the 2020 Abel Prize Announcement.
From playlist Popular presentations
Use Euler Phi Function to Prove the Infinitude of Prime Numbers
Use Euler Phi Function to Prove the Infinitude of Prime Numbers
From playlist Elementary Number Theory
Theory of numbers: Gauss's lemma
This lecture is part of an online undergraduate course on the theory of numbers. We describe Gauss's lemma which gives a useful criterion for whether a number n is a quadratic residue of a prime p. We work it out explicitly for n = -1, 2 and 3, and as an application prove some cases of Di
From playlist Theory of numbers