Mertens Conjecture Disproof and the Riemann Hypothesis | MegaFavNumbers
#MegaFavNumbers The Mertens conjecture is a conjecture is a conjecture about the distribution of the prime numbers. It can be seen as a stronger version of the Riemann hypothesis. It says that the Mertens function is bounded by sqrt(n). The Riemann hypothesis on the other hand only require
From playlist MegaFavNumbers
The Collatz Conjecture and Fractals
Visualizing the dynamics of the Collatz Conjecture though fractal self-similarity. Support this channel: https://www.patreon.com/inigoquilez Tutorials on maths and computer graphics: https://iquilezles.org Code for this video: https://www.shadertoy.com/view/llcGDS Donate: http://paypal.m
From playlist Maths Explainers
Nikos Frantzikinakis: Ergodicity of the Liouville system implies the Chowla conjecture
Abstract: The Chowla conjecture asserts that the signs of the Liouville function are distributed randomly on the integers. Reinterpreted in the language of ergodic theory this conjecture asserts that the Liouville dynamical system is a Bernoulli system. We prove that ergodicity of the Liou
From playlist Jean-Morlet Chair - Lemanczyk/Ferenczi
The Millin Series (A nice Fibonacci sum)
We derive the closed form for the Millin series, which involves reciprocals of the 2^nth Fibonacci numbers. We use Catalan's identity, the convergence of a subsequence, and the golden ratio. Catalan's Identity: https://youtu.be/kskAtiWC_w8 Another reciprocal Fibonacci sum: https://youtu.b
From playlist Identities involving Fibonacci numbers
CTNT 2018 - "The Biggest Known Prime Number" by Keith Conrad
This is lecture on "The Biggest Known Prime Number", by Keith Conrad, during CTNT 2018, the Connecticut Summer School in Number Theory. For more information about CTNT and other resources and notes, see https://ctnt-summer.math.uconn.edu/
From playlist CTNT 2018 - Guest Lectures
The Biggest Known Prime Number - Keith Conrad [2018]
Slides for this talk: https://ctnt-summer.math.uconn.edu/wp-content/uploads/sites/1632/2018/05/mersennetalkCTNT.pdf May 29: Keith Conrad (UConn) Title: The Biggest Known Prime Number. Abstract: There are infinitely many primes, but at any moment there is a biggest known prime. Earlier t
From playlist Number Theory
Catalan Mersenne Primes 2^127-1 #MegaFavNumbers
#MegaFavNumbers oh I made a mistake, i meant partitions of sets with n elements. Hope you enjoy
From playlist MegaFavNumbers
The evenness conjecture in equivariant unitary bordism – Bernardo Uribe – ICM2018
Topology Invited Lecture 6.9 The evenness conjecture in equivariant unitary bordism Bernardo Uribe Abstract: The evenness conjecture for the equivariant unitary bordism groups states that these bordism groups are free modules over the unitary bordism ring in even dimensional generators.
From playlist Topology
What is the Riemann Hypothesis?
This video provides a basic introduction to the Riemann Hypothesis based on the the superb book 'Prime Obsession' by John Derbyshire. Along the way I look at convergent and divergent series, Euler's famous solution to the Basel problem, and the Riemann-Zeta function. Analytic continuation
From playlist Mathematics
Joseph Ayoub - 5/5 Sur la conjecture de conservativité
La conjecture de conservativité affirme qu'un morphisme entre motifs constructibles est un isomorphisme s'il en est ainsi de l'une des ses réalisations classiques (de Rham, ℓ-adique, etc.). Il s'agit d'une conjecture centrale dans la théorie des motifs ayant des conséquences concrètes sur
From playlist Joseph Ayoub - Sur la conjecture de conservativité
The Frenet Serret equations (example) | Differential Geometry 19 | NJ Wildberger
Following from the last lecture on the Frenet Serret equations, we here look in detail at an important illustrative example--that of a helix. The Fundamental theorem of curves is stated--that the curvature and torsion essentially determine a 3D curve up to congruence. We introduce the osc
From playlist Differential Geometry
Fundamentals of Mathematics - Lecture 09: What you can't do with Groups; Special primes.
course page: http://www.uvm.edu/~tdupuy/logic/Math52-Fall2017.html handouts - DZB, Emory videography - Eric Melton, UVM
From playlist Fundamentals of Mathematics
Primes, Complexity and Computation: How Big Number theory resolves the Goldbach Conjecture
This lecture, which begins at 2:45, shows how Big Number theory, together with an understanding of prime numbers and their distribution resolves the Goldbach Conjecture, which states that every even number greater than two is the sum of two primes. Notions of complexity and computation,
From playlist MathSeminars
Joseph Ayoub - 4/5 Sur la conjecture de conservativité
La conjecture de conservativité affirme qu'un morphisme entre motifs constructibles est un isomorphisme s'il en est ainsi de l'une des ses réalisations classiques (de Rham, ℓ-adique, etc.). Il s'agit d'une conjecture centrale dans la théorie des motifs ayant des conséquences concrètes sur
From playlist Joseph Ayoub - Sur la conjecture de conservativité
Primes without a 7 - Numberphile
James Maynard discusses his proof that infinite primes exist missing each base 10 digit - he uses 7 as his arbitrary example. More links & stuff in full description below ↓↓↓ More videos with James Maynard: http://bit.ly/JamesMaynard The paper on primes with restricted digits: https://ar
From playlist James Maynard on Numberphile
Prime numbers, Ulam Spirals and other cool numbery stuff with Dr James Grime. More links & stuff in full description below ↓↓↓ James Clewett on spirals at: http://youtu.be/3K-12i0jclM And more to come soon... * subscribing to numberphile does not really change your physical appearance!
From playlist James Grime on Numberphile
Combinatorial affine sieve - Alireza Salehi Golsefidy
Speaker: Alireza Salehi Golsefidy (UCSD) Title: Combinatorial affine sieve Abstract: In this talk the general setting of affine sieve will be presented. Next I will explain the Bourgain-Gamburd-Sarnak method on proving affine sieve in the presence of certain spectral gap. Finally I will sa
From playlist Mathematics
Complexity problems in enumerative combinatorics – Igor Pak – ICM2018
Combinatorics Invited Lecture 13.9 Complexity problems in enumerative combinatorics Igor Pak Abstract: We give a broad survey of recent results in enumerative combinatorics and their complexity aspects. © International Congress of Mathematicians – ICM www.icm2018.org Os direitos s
From playlist Combinatorics
Euclid's Perfects and Mersenne's Primes (visually)
In this video, we show a visual proof of a theorem first proved by Euclid. The theorem states that if 2 raised to the p minus 1 is prime, then 2 raised to the (p-1) multiplied by that prime must be perfect. We end with some commentary about perfect numbers and primes of this special form (
From playlist Proof Writing
I continue the look at higher-order, linear, ordinary differential equations. This time, though, they have variable coefficients and of a very special kind.
From playlist Differential Equations