Proof of Concept
Proof of Concept
  • 27
  • 295 576
Rethinking the real line #SoME3
We take a geometric approach to rational numbers, to rethink how to organize the real line. Along the way, we visualize Diophantine approximation and continued fractions. And your favourite number, pi.
Much of the mathematics here is based on the following article:
Series, C. The geometry of markoff numbers. The Mathematical Intelligencer 7, 20-29 (1985). doi.org/10.1007/BF03025802
A big thanks to the Summer of Math Exposition competition for the motivation to make this happen, and a big thanks to my audience for forgiving my video-editing non-skills.
Some of the software used in creating this: Sage Mathematics Software, Manim, VPython, p5.js, Krita, Audacity, Kdenlive.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Music used in the video:
Walk Through the Park -- TrackTribe
George Street Shuffle -- Kevin MacLeod
Quarter Mix -- Freedom Trail Studio
Love Struck -- E's Jammy Jams
George Street Shuffle by Kevin MacLeod is licensed under a Creative Commons Attribution 4.0 license. creativecommons.org/licenses/by/4.0/
Source: incompetech.com/music/royalty-free/index.html?isrc=USUAN1300035
Artist: incompetech.com/
zhlédnutí: 93 493

Video

The Intuition behind the Double-And-Add / Square-And-Multiply Algorithm (Also Just a Fun Puzzle!)
zhlédnutí 2,4KPřed 2 lety
This video develops the Double-And-Add Algorithm entirely intuitively through a fun recreational math puzzle, so you will always be able to recreate it for yourself and use it when you need it. (Also known as Square-And-Multiply and occasionally as the Chanda Sutra Method.) The video requires that you are familiar with binary. Here's the tree I draw in the video: oeis.org/A232559 (In my video, ...
ADFGVX Cipher: Encryption and Decryption (Updated)
zhlédnutí 15KPřed 2 lety
Encryption and Decryption of the World War One ADFGVX Cipher, through examples. This video replaces an earlier one with the same content, but has some improvements and corrections. #cryptography
Lehmer Factor Stencils: A paper factoring machine before computers
zhlédnutí 53KPřed 2 lety
In 1929, Derrick N. Lehmer published a set of paper stencils used to factor large numbers by hand before the advent of computers. We explain the math behind the stencils, which includes modular arithmetic, quadratic residues, and continued fractions, including my favourite mathematical visualization for continued fractions. *VIDEO CORRECTION*: I made a copying error when setting up the recurren...
Studying Apollonian Circle Packings using Group Theory
zhlédnutí 6KPřed 3 lety
This video is in response to a colleague who asked for short videos about how we use group theory in our research. One of my interests is Apollonian circle packings. Some links: Wikipedia: en.wikipedia.org/wiki/Apollonian_gasket An article in New Scientist by Dana Mackenzie: www.americanscientist.org/article/a-tisket-a-tasket-an-apollonian-gasket A good math paper to start: arxiv.org/abs/math/0...
The modular inverse via Gauss not Euclid
zhlédnutí 2,1KPřed 3 lety
We demonstrate a lesser-known algorithm for taking the inverse of a residue modulo p, where p is prime. This algorithm doesn't depend on the extended Euclidean algorithm, so it can be learned independently. This is part of a larger series on modular arithmetic: czcams.com/play/PLrm9Y qlNyWBQEKBSrr_Uh16gEWhJzw.html
The extended Euclidean algorithm in one simple idea
zhlédnutí 11KPřed 3 lety
An intuitive explanation of the extended Euclidean algorithm as a simple modification of the Euclidean algorithm. This video is part of playlist on GCDs and the Euclidean algorithm: czcams.com/play/PLrm9Y qlNxXccpwYQfllCrHRJWwMky-.html
ADFGVX Cipher: Encryption and Decryption (OLD VERSION: SEE NEW VERSION LINK BELOW)
zhlédnutí 10KPřed 3 lety
This video has been replaced with an updated video: visit czcams.com/video/T0xfKiU9Rr4/video.html Encryption and Decryption of the World War One ADFGVX Cipher, through examples.
Cryptanalysis of Vigenere cipher: not just how, but why it works
zhlédnutí 31KPřed 3 lety
The Vigenere cipher, dating from the 1500's, was still used during the US civil war. We introduce the cipher and explain a standard method of cryptanalysis based on frequency analysis and the geometry of vectors. We focus on visual intuition to explain why it works. The only background needed is some familiarity with vectors and probabilities. For more on this method: _Introduction_to_Cryptogra...
The Euclidean Algorithm: How and Why, Visually
zhlédnutí 30KPřed 3 lety
We explain the Euclidean algorithm to compute the gcd, using visual intuition. You'll never forget it once you see the how and why. Then we write it out formally and do an example. This is part of a playlist on GCDs and the Euclidean algorithm: czcams.com/play/PLrm9Y qlNxXccpwYQfllCrHRJWwMky-.html
Greatest common divisor and least common multiple: building blocks
zhlédnutí 2,6KPřed 3 lety
The intuition behind gcd and lcm, from the perspective of factorizations. For aspiring mathematicians already familiar with prime numbers as the building blocks of integers. Learn the intuition, the definitions, and gain some practice. This video is appropriate for high school, for an introduction to proof course, for undergraduate mathematics majors, or for the mathematically inclined, especia...
Modular Arithmetic: Multiplication in Motion
zhlédnutí 1,4KPřed 4 lety
Modular arithmetic visually! We explore multiplication modulo n, and discover and prove that the multiplication-by-a map f(z) = az mod n is bijective if and only if a and n are coprime. We use a visualization tool called a "dynamical portrait." This treatment is inspired by Martin H. Weissman's beautiful book, An Illustrated Theory of Numbers. This video is appropriate for an introduction to pr...
Modular Arithmetic: Addition in Motion
zhlédnutí 1,3KPřed 4 lety
Modular arithmetic visually! We explore addition modulo n, and discover and prove the number of cycles and their sizes. We use a visualization tool called a "dynamical portrait." This treatment is inspired by Martin H. Weissman's beautiful book, An Illustrated Theory of Numbers. This video is appropriate for an introduction to proof course, for undergraduate mathematics majors, or for the mathe...
Modular Arithmetic: In Motion
zhlédnutí 2,9KPřed 4 lety
Modular arithmetic visually! We use a visualization tool called a "dynamical portrait." We explore addition and multiplication modulo n, and discover and prove the portrait is made of cycles if and only if the function (f(z) = z a mod n or f(z) = az mod n) is bijective. This treatment is inspired by Martin H. Weissman's beautiful book, An Illustrated Theory of Numbers. This video is appropriate...
Modular Arithmetic: Under the Hood
zhlédnutí 2KPřed 4 lety
Modular arithmetic visually! For aspiring mathematicians already familiar with modular arithmetic, this video describes how to formalize the concept mathematically: to define the integers modulo n, to define the operations of addition and multiplication, and check that these are well-defined. This video is appropriate for an introduction to proof course, for undergraduate mathematics majors, or...
Modular Arithmetic: User's Manual
zhlédnutí 2,5KPřed 4 lety
Modular Arithmetic: User's Manual
Intro to LaTeX for beginning math majors
zhlédnutí 1,1KPřed 4 lety
Intro to LaTeX for beginning math majors
Abelian sandpile animation: toppling of an odometer of integral linear growth
zhlédnutí 215Před 5 lety
Abelian sandpile animation: toppling of an odometer of integral linear growth
Abelian sandpile animation: toppling of an odometer of integral quadratic growth
zhlédnutí 224Před 5 lety
Abelian sandpile animation: toppling of an odometer of integral quadratic growth
Abelian sandpile animation: toppling of an odometer of rational linear growth
zhlédnutí 149Před 5 lety
Abelian sandpile animation: toppling of an odometer of rational linear growth
Abelian sandpile animation: toppling of an odometer of rational quadratic growth
zhlédnutí 212Před 5 lety
Abelian sandpile animation: toppling of an odometer of rational quadratic growth
Abelian sandpile animation: toppling of an odometer of rational quadratic growth
zhlédnutí 285Před 5 lety
Abelian sandpile animation: toppling of an odometer of rational quadratic growth
The Intuition Behind Proof by Induction
zhlédnutí 11KPřed 6 lety
The Intuition Behind Proof by Induction
The Dystopian Perspective on Logical Negation
zhlédnutí 403Před 6 lety
The Dystopian Perspective on Logical Negation
Anatomy of a proof: if n is even, then n squared is even
zhlédnutí 13KPřed 7 lety
Anatomy of a proof: if n is even, then n squared is even
Sets and their elements
zhlédnutí 744Před 8 lety
Sets and their elements
What is an "if-then" statement?
zhlédnutí 1,9KPřed 8 lety
What is an "if-then" statement?

Komentáře

  • @gravity6316
    @gravity6316 Před hodinou

    WOW. You explain stuff in such an intuitive manner

  • @navauchiha
    @navauchiha Před 4 dny

    This should be first hit for Euclidean algorithm

  • @ahmadag1820
    @ahmadag1820 Před 4 dny

    our explanations are similar except I cut the box Into Identical sections

  • @caiofernando
    @caiofernando Před 13 dny

    Excellent video.

  • @9WEAVER9
    @9WEAVER9 Před 17 dny

    A new classic here! I've had this video in my Downloads for some time.

  • @manarsalem1685
    @manarsalem1685 Před měsícem

    This was mind-blowing to watch. I'm amazed at how you could convey everything so neatly and clearly.

  • @md.arifulislamroni2946
    @md.arifulislamroni2946 Před měsícem

    love it;❤

  • @AbjSir
    @AbjSir Před měsícem

    Thanks.

  • @Intresting-stuff
    @Intresting-stuff Před měsícem

    Weird how this video was located next to Lemmino's new video

  • @NestPavel
    @NestPavel Před měsícem

    Came here after Leminno video about Kryptos. Nice video! And the puzzle was fun, althought at first I didn't know what to do with the fact that last row is incomplete. But when you think about it, it becomes more or less obvious.

  • @davethesid8960
    @davethesid8960 Před 2 měsíci

    Really enjoyed this video, gave me a new reason to love maths even more! One tiny note: it should be pronounced "Dirishley".

  • @IptenT
    @IptenT Před 2 měsíci

    This is fantastic, thank you!

  • @maynardtrendle820
    @maynardtrendle820 Před 2 měsíci

    I think this is a WILDLY helpful video. Awesome job.😎

  • @cupostuff9929
    @cupostuff9929 Před 2 měsíci

    7:25 once you dropped down into the origin my brain immediately made the connection between the inverse square law & what was being talked about previously

  • @sasanrahmatian312
    @sasanrahmatian312 Před 3 měsíci

    At 2:30 you said, “. . . like Pi as the ratio of diameter to circumference”.

  • @coryanders6328
    @coryanders6328 Před 3 měsíci

    This didn't do it for me. I feel as if my understanding has regressed after watching this😢

  • @steveglemaud3459
    @steveglemaud3459 Před 3 měsíci

    I don't understand shit she said . 😅

  • @locopenguin6161
    @locopenguin6161 Před 4 měsíci

    Amazing

  • @aMulliganStew
    @aMulliganStew Před 4 měsíci

    Hello Dr. Kate. Loved this video. Previously, I was convinced that on the interval [0,1) the number of reals was equivalent the number of whole numbers and that Cantor's diagonal proof was junk. Your video changed my mind about the former. :) Now the proposition that .999-repeating is identical to 1 has re-entered my life. As I currently understand this video, they aren't equal for .999-repeating never intersects 1.0 in the graph. (But, then again, thinking as I type this, It never passes 1-0 either.) For very-part-time, recreational, arm-chair mathematicians like myself, could you maybe, please, discuss .999-repeating and how it is or isn't the same as one? Thanks much if you do. (Pretty much the same if you take a pass.) In either case, thanks for the video.

  • @bartomiejpotaman6973
    @bartomiejpotaman6973 Před 5 měsíci

    Youre a wonderful teacher. I mean it. You made it very suggestive what the answer is so that I could come up with it myself. Brilliantly done and I bet you - now it is mine forever!

  • @TheWesternPrince
    @TheWesternPrince Před 5 měsíci

    Amazing video! I personally think this explanation is much better than the ones shown on AwesomeMath L4

  • @klevisimeri607
    @klevisimeri607 Před 5 měsíci

    • @klevisimeri607
      @klevisimeri607 Před 5 měsíci

      This is the first explanation I have seen that describes the deeper understanding. Plus voice is very calm.

  • @user-ll7mp7qx8d
    @user-ll7mp7qx8d Před 5 měsíci

    Nn

  • @cellmaker1
    @cellmaker1 Před 5 měsíci

    Great stuff. However, it would have been useful to show an example where there are no common factors except for 1.

  • @davidhand9721
    @davidhand9721 Před 5 měsíci

    So how big would you need these circles to be in order to crack RSA? You know, hypothetically?

  • @naruhitoabiku9451
    @naruhitoabiku9451 Před 5 měsíci

    you are a legend

  • @kikivoorburg
    @kikivoorburg Před 6 měsíci

    This also sort of explains why the golden ratio φ is like the “most irrational number” - its continued fraction ‘address’ consists of only 1s - so all the rational approximations are similarly bad! Since the coefficients are always natural numbers, 1 is the worst possible! Edit: fixed it’s instead of its.

  • @James2210
    @James2210 Před 6 měsíci

    You can get the circumference of the observable universe to a planck length with only 64 digits if I recall

  • @PaperboySilver
    @PaperboySilver Před 6 měsíci

    🎯 Key Takeaways for quick navigation: 00:01 📏 *Introduction to real numbers and their representation.* 03:10 🧮 *Decimal expansion, limitations, and notable approximations.* 04:57 🎈 *Visualizing rational numbers, Reuleaux theorem, and their relationship.* 07:25 🌐 *Rational numbers explained through projective geometry.* 09:35 🛣️ *Fairy subdivision, its comparison to decimals, and pi's continued fraction.* 12:57 🥧 *Discovering Pi's true nature via its continued fraction expansion.* Made with HARPA AI

  • @wurnotantmlb
    @wurnotantmlb Před 6 měsíci

    whatttttt this is the most exciting math video that ive seen!!!

  • @buckleysangel7019
    @buckleysangel7019 Před 6 měsíci

    Beautiful videos!

  • @kindpotato
    @kindpotato Před 6 měsíci

    I haven't even watched the video yet, but I've been a big fan of these kind of fractals since I was young and always wanted to write a program to generate them. I just wrote a program that finds the circles very well for a very specific example. I'm excited to learn more about three circles tangent to each other lol.

  • @henrynwosu6277
    @henrynwosu6277 Před 6 měsíci

    I wish I could say thank you in person. I am a Mechatronics Engineering Student and we are Studying the Routh-Hourwitz Criterion in Control Systems. I'm trying to understand this so I can understand the proof of the Routh-Hurwitz criterion better. I have to say, you are part of the people that make my degree worthwhile. Thanks so much for what you do. Thanks for not giving up on prooving mathematial facts. Thanks for not giving up on intuition. Thanks for not obscuring mathematical concepts . Thanks for making it accessible. Thank you. Thank you. Thank you !!!!😢😢😢😢😢😢😢.

  • @Aesthetycs
    @Aesthetycs Před 6 měsíci

    I never thought of continued fractions as binaries.

  • @Halfcast365
    @Halfcast365 Před 6 měsíci

    when you divide by 6 you get 3 remainder 4? what are you dividing? assuming you are dividing 22 by 6, this is giving us 3.6. could you clarify this part as as you stated it gets tricky but you dont explain the workings of this very clearly

  • @jonahunderhill
    @jonahunderhill Před 6 měsíci

    Took me a bit to get a proof of multiplication being well defined, but here goes: We have n|a-a' and n|b-b'. We want n|ab-a'b'. Since n|b-b', we get n|a(b-b') since multiplying an arbitrary integer won't change whether it's divisible Since n|a-a', we get n|(a-a')b' for the same reason The sum of 2 things with a common factor will have that same common factor, so n|a(b-b') + (a-a')b' n|ab-ab'+ab'-a'b', distributing the multiplication n|ab-a'b'

  • @ewthmatth
    @ewthmatth Před 7 měsíci

    "everyone's favorite, pi" Hmmm, not sure I'm familiar. Is that like half of tau, or something? ;P

  • @carlosraventosprieto2065
    @carlosraventosprieto2065 Před 7 měsíci

    I LOVED your video named rethinking the real line and now i saw this one and came in to your channel and saw that you are the same person!!! i didnt subscribe 3 months ago but i do now with a smile on my face :)

  • @ghostagent3552
    @ghostagent3552 Před 7 měsíci

    Everywhere I go with visual representations for math, I ended up seeing infinitely repeating fractals

  • @carlosraventosprieto2065
    @carlosraventosprieto2065 Před 7 měsíci

    I LOVE YOUR LETTERS

  • @tunvas
    @tunvas Před 7 měsíci

    you're a genius

  • @josephhosier7770
    @josephhosier7770 Před 7 měsíci

    Is anyone able to help me understand the statement at 13:20? If we take the case of N = 10, which gives quadratic residues mod N of {0,1,4,5,6,9}. The prime divisors of 10 are 2 and 5. The quadratic residues mod 5 are {0,1,4} and those of 2 are {0,1}. x = 5,6 and 9 are all cases where the Fundamental Principle is failing to hold. What am I missing? Is the logic meant to be the other way around?

    • @d.l.7416
      @d.l.7416 Před 3 měsíci

      5,6,9 are 0,1,4 mod 5 and 4,5,6,9 are 0,1,0,1 mod 2 so they are quadratic residues mod 5 and 2

  • @PerryWagle
    @PerryWagle Před 7 měsíci

    Thank you very much for the visualizations!

  • @petersmythe6462
    @petersmythe6462 Před 7 měsíci

    355/113 really is unbelievably accurate. Specifically, it is 294 times more accurate than it is precise. Compare: 2721/1001 for e, which is only 9 times more accurate than it is precise. 22/7 is 16x more accurate than precise, while 19/7 is only 5x more accurate than precise. π just seems to have several inexplicably good simple rational approximations. Heck, even 3/1 is better at approximating π than e.

    • @petersmythe6462
      @petersmythe6462 Před 7 měsíci

      You're basically getting about 2 sig figs for free.

  • @Mark-nm9sm
    @Mark-nm9sm Před 7 měsíci

    Thank you so much for making us think

  • @user-vg1br9fx8i
    @user-vg1br9fx8i Před 7 měsíci

    سؤال اتمنى تردي بدري لان بكرا الشرح حقي الحين الارقام513264 منين جبناهن؟!

  • @goldenboy7697
    @goldenboy7697 Před 7 měsíci

    You showed a visual proof with the triangles showing that it leaves 3 if the gcd is 3 never breaking part the groups which the amount would be the gcd, but I still dont understand why that works or happens, you just showed that it did, but i don't understand why subtracting it from each side leaves the gcd.

  • @jeffocks793
    @jeffocks793 Před 8 měsíci

    This has made me very happy. Fabulous

  • @obinnaomego1971
    @obinnaomego1971 Před 8 měsíci

    I am subscribing