No new videos since April 2026.
About this show
Enter the world of the Mathologer for really accessible explanations of hard and beautiful math(s).
In real life the Mathologer is a math(s) professor at Monash University in Melbourne, Australia and goes by the name of Burkard Polster. These days Marty Ross another math(s) professor, great friend and collaborator for over 20 years also plays a huge role behind the scenes, honing the math(s) and the video scripts with Burkard. And there are Tristan Tillij and Eddie Price who complete the Mathologer team, tirelessly proofreading and critiquing the scripts and providing lots of original ideas. If you like Mathologer, also check out years worth of free original maths resources on Burkard and Marty's site http://www.qedcat.com.
Videos come from the channel's public YouTube feed. The artwork is the newest video thumbnail. Last updated . Names, artwork and text belong to their publishers.
Cosmos
Similar by topic and creator
- Kurzgesagt – In a Nutshell
Shares the topics Education and Science. - Tom Scott
Shares the topics Education and Science. - 3Blue1Brown
Shares the topics Education and Science.
Videos
What's hiding beneath? Animating a mathemagical gem
· 9 min
There is a lot more to the pretty equation 10² + 11² + 12² = 13² + 14² than meets the eye. Let me show you. 00:00 Intro 00:07 Animated visual proofs 03:35 Mathologer materializes 06:31 Three puzzles 07:45 Thanks! Notes: The beautiful visual proof for the squares pattern is based on a note by Michael Boardman in Mathematics Magazine: https://tinyurl.com/2d4y7wtf As far as I can tell, I am the first one to notice that this beautiful argument also works for those consecutive integer sums (but I am probably wrong :) I first read about the two patterns that this video is about in the 1966 book Excursions in Number Theory by Ogilvy and Anderson (pages 91 and 92). The article "Consecutive integers having equal sums of squares" J.S. Vidger, Mathematics Magazine, Vol. 38, No. 1 (Jan., 1965), pp. 35-42. is dedicated to finding generalisations of the sort of equations that the squares pattern is all about. Here is a particularly, nice example derived at the very end of this article: 4² + ... + 38² = 39² + ... + 48². This article is on JSTOR https://www.jstor.org/stable/2688015. I first encountered the Russian painting that puzzle 2 is about in an article by Ethan Siegel about 10² + 11² + 12² = 13² + 14² and Co. https://tinyurl.com/y7p5k4kw Nice find :) 365 is the smallest integer that can be expressed as a sum of consecutive square in more than one way 365 = 10² + 11² + 12² = 13² + 14² (and of course 365 also happens to be the number of days in a year :) Viewer Exception2001: Knowing the result, it's fun to think about making an efficient one-page calendar where the front is a 13x13 square and the back is a 14x14 square, with each square containing a date :D Viewer k k notes that consecutive squares also take care of leap years :) 8² + 9² + 10² + 11² = 366 Christofer Hallberg did some computer experiments and found the following beautiful equation: 4³+...+28³=30³+31³+32³+33³+34³ There are some nice families of equations involving sums of alternating sums of consecutive squares. Check out Roger Nelsen's one glance proof https://tinyurl.com/2xauf83u 2² - 3² + 4² = -5² + 6² 4² - 5² + 6² - 7² + 8² = -9² + 10² -11² + 12² ... Fun fact: the top part of the logo is the top part of the last image I show in the previous video https://youtu.be/94mV7Fmbx88?t=2547 Several viewers (Exception1, Nana Macapagal, B Smith, Shay) noticed that the projected cubes pattern differences are of the form n²(n+1)²/2 = 2(1 + 2 + 3 + ... + n)². 5³ + 6³ = 7³ - 2 16³ + 17³ + 18³ = 19³ + 20³ - 18 33³ + 34³ + 35³ + 36³ = 37³ + 38³ + 39³ - 72 56³ + 57³ + 58³ + 59³ + 60³ = 61³ + 62³ + 63³ + 64³ - 200 85³ + 86³ + 87³ + 88³ + 89³ + 90³ = 91³ + 92³ + 93³ + 94³ + 95³ - 450 And that actually means that the nice visual proofs in the video do extend to these modified cubes pattern because the six slices of the cube that I show in the video actually do form the shell of a smaller cube LESS two diametrically opposed corners. For the the 4th powers differences the formula is 4³(1 + 2 + 3 + ... + n)³ = 8n³(n+1)³ 7⁴ + 8⁴ = 9⁴ - 64 22⁴ + 23⁴ + 24⁴ = 25⁴ + 26⁴ - 1728 45⁴ + 46⁴ + 47⁴ + 48⁴ = 49⁴ + 50⁴ + 51⁴ - 13824 76⁴ + 77⁴ + 78⁴ + 79⁴ + 80⁴ = 81⁴ + 82⁴ + 83⁴ + 84⁴ - 64000 There is another nice piece of 4d hypercube geometry that goes with this observation. The new emerging pattern then breaks again with 5th powers. Here the sequence of differences starts like this: 2002, 162066, 2592552, 20002600, 101258850, .... But who knows , ... :) The triangular numbers tn=1+2+3+...+n that feature prominently in all this arrange themselves into a nice pattern like this t1+t2+t3=t4 t5+t6+t7+t8=t9+t10 t11+t12+...+t15=t16+t17+t18 etc. Solving x² + (x+1)² = (x+2)² has two integer solutions. The first is 3 corresponding to 3² + 4² = 5². The second is -1 corresponding to (-1)² + 0² = 1². You also get a second solution for every other equation in the square pattern. (-1)² + 0² = 1² (-2)² + (-1)² + 0² = 1² + 2² etc. Donald Sayers and qyrghyz point out that there is a nice discussion of…
Not rated yetFibonacci = Pythagoras: Help save a beautiful discovery from oblivion
· 42 min
In 2007 a simple beautiful connection Pythagorean triples and the Fibonacci sequence was discovered. This video is about popularising this connection which previously went largely unnoticed. 00:00 Intro 07:07 Pythagorean triple tree 13:44 Pythagoras's other tree 16:02 Feuerbach miracle 24:28 Life lesson 26:10 The families of Plato, Fermat and Pythagoras 30:45 Euclid's Elements and some proofs 37:57 Fibonacci numbers are special 40:38 Eugen Jost's spiral 41:20 Thank you!!! 42:27 Solution to my pearl necklace puzzle The two preprints by H. Lee Price and and Frank R. Bernhart and another related paper by the same authors: https://arxiv.org/abs/0809.4324 https://arxiv.org/abs/math/0701554 https://tinyurl.com/y6k4eyx5 The wiki page on Pythagorean triples is very good and very comprehensive https://en.wikipedia.org/wiki/Pythagorean_triple Wiki page on Pythagorean triple trees https://en.wikipedia.org/wiki/Tree_of_primitive_Pythagorean_triples Mathematica code for the Pythagorean Christmas tree by chyanog https://tinyurl.com/2z66rfkb Geoalgebra app for the Pythagoras tree fractal by Juan Carlos Ponce Campuzano https://www.geogebra.org/m/VU4SUVUp Connection to the Farey tree/Stern-Brocot tree in a paper by Shin-ichi Katayama https://tinyurl.com/vmvcs729 David Pagni (on the extra special feature of the Fibonacci number) https://www.jstor.org/stable/30215477 Eugen Jost's Fibonacci meets Pythagoras spiral (in German) https://mathothek.de/katalog/fibonacci-meets-pythagoras-eine-begegnung-die-zur-spirale-wird/ Bug report: 06:06 - right circle doesn't touch line (I mucked up :( Puzzle time codes: 11:41 Puzzle 1: a) Fibonacci box of 153, 104, 185 b) path from from 3, 4, 5, to this triple in the tree 16:02 Puzzle 2: Area of gen 5 Pythagorean tree 25:55 Puzzle 3: Necklace puzzle Some interesting tidbits: Jakob Lenke put together an app that finds the route from 3,4,5 to your primitive Pythagorean triple of choice inside the tree. Thanks Jacob https://pastebin.com/T71NP8Z9 theoriginalstoney and Michael Morad observed that at 39:28 (last section, extra special Fibonacci) the difference between the two righthand numbers (4 and 5, 12 and 13, 30 and 34, 80 and 89) are also squares of the Fibonacci numbers: F_(2n+3) - 2 F_(n+1) F_(n+2)=(F_n)^2 Éric Bischoff comments that the trick to get a right angle at 25:40 is popularized in French under the name "corde d'arpenteur". This term refers to a circular rope with 12 equally spaced nodes. If you pull 3, 4 and 5-node sides so the rope is tense, you get a right angle. See article "Corde à nœuds" on Wikipedia Various viewers told me what F.J.M. stands for: Fredericus Johannes Maria Barning, Freek, b. Amsterdam 03.10.1924, master's degree in mathematics Amsterdam GU 1954|a|, employee Mathematical Center (1954-), deputy director Mathematical Center, later Center for Mathematics and Informatics (1972-1988) Deceased. Amstelveen 27.06.2012, begr. Amsterdam (RK Bpl. Buitenveldert) 04.07.2012. John Klinger remarks that if the four numbers in the box are viewed as fractions, the two fractions are equal to the tangents of half of each of the two acute angles of the triangle. Colin Pountney: Here is another piece in the jigsaw. The link to Pascals triangle. It only works for the Fermat series of triples (ie the set of "middle children"). Choose any row in Pascals triangle. Multiply the odd entries by 1, 2, 4, 8, ..... and add to get the top left entry in a Fibonacci box. Do the same with the even entries to get the top right entry. For example taking the 1 5 10 10 5 1 row, we have top left number = 1*1 + 2*10 + 4*5 = 21. Top right number = 1*5 + 2*10 + 4*1 =29. For example taking the 1 6 15 20 15 6 1 row we have top left = 1*1 + 2*15 + 4*15 + 8*1 = 99. Top right = 1*6 + 2*20 + 4*6 =70. Not obviously useful, but it seems to make things more complete. Ricardo Guzman: Another cool property of Fibonacci numbers: Take any 3 consecutive Fibonacci numbers: 55,89,144. The difference of squares of the…
Not rated yetPythagoras twisted squares: Why did they not teach you any of this in school?
· 38 min
A video on the iconic twisted squares diagram that many math(s) lovers have been familiar with since primary school. Surprisingly, there is a LOT more to this diagram than even expert mathematicians are aware of. And lots of this LOT is really really beautiful and important. A couple of things covered in this video include: Fermat's four squares theorem, Pythagoras for 60- and 120-degree triangles, the four bugs problem done using twisted squares and much more. 00:00 Intro 05:32 3 Squares: Fermat's four square theorem 12:51 Trithagoras 20:29 Hexagoras 22:06 Chop it up: More twisted square dissection proofs 23:42 Aha! Remarkable properties of right triangles with a twist 26:35 Mutants: Unusual applications of twisted squares 30:38 Op art: The four bugs problem 36:01 Final puzzle 36:32 Animation of Cauchy-Schwarz proof 37:16 Thanks!! Here are a couple of links for you to explore: My first Pythagoras video from four years ago: https://youtu.be/p-0SOWbzUYI?t=732 A collection of over 100 proofs of Pythagoras theorem at Cut-the-knot https://www.cut-the-knot.org/pythagoras/ (quite a few with animations) I cover proofs 3, 4, 5 ( :), 9, 10, 76, 104. Other proofs closely related to what I am doing in this video are 55, 89, and 116. A very good book that touches on a lot of the material in this video by Claudi Alsina and Roger B. Nelsen - Icons of Mathematics: An Exploration of Twenty Key Images (2011). Check out in particular chapters 1-3 and chapter 8.3. Fermat's four square theorem: Alf van der Poorten's super nice proof https://arxiv.org/abs/0712.3850 Fibonacci seems to be the discoverer of the connection between Pythagorean triples and arithmetic sequences of squares of length 3 https://en.wikipedia.org/wiki/Congruum Trithagoras: Wayne Robert's pages. Start here and then navigate to "The theory to applied to the geometry of triangles" https://tinyurl.com/3k6afad4 M. Moran Cabre, Mathematics without words. College Mathematics Journal 34 (2003), p. 172. Claudi Alsina and Roger B. Nelsen, College Mathematics Journal 41 (2010), p. 370. (Trithagoras for 30 and 150-degree triangles) Nice writeup about how to make Eisenstein triples from Eisenstein integers http://ime.math.arizona.edu/2007-08/0221_cuoco_handout2.pdf More people should know about Eisenstein: https://mathshistory.st-andrews.ac.uk/Biographies/Eisenstein/ Other twisted square dissection proofs: There is an Easter Egg contained in the first proof. Five days after publishing the video only one person appears to have noticed it :) Here is an alternative version of the animation that only uses shifts that I put on Mathologer 2 https://www.youtube.com/shorts/vT9wUpu_Vco The four bugs problem: Actually I got something wrong here. Martin Gardner mentioned the four bugs for the first time in 1957 as a puzzle Martin Gardner actually mentioned the four bugs for the first time in 1957 as a puzzle (Gardner, M. November, 1957 Mathematical Games. Nine titillating puzzles, Sci. Am. 197, 140–146.) The 1965 article that is accompanied by the nice cover that I show in the video talks, among many other things, about the more general problem of placing bugs on the corners of a regular n-gon. If you've got access to JSTOR, you can access all of Martin Gardner's articles through them. https://www.jstor.org/journal/scieamer (all issues of the Scientific American) https://www.jstor.org/stable/e24941962 (follow the Mathematical Games link) https://www.jstor.org/stable/e24931930 (follow the Mathematical Games link) https://www.jstor.org/journal/scieamer (all issues of the Scientific American) Here are a couple of other online resources worth checking out. https://tinyurl.com/4erz3zmf https://tinyurl.com/ykvvj5sw Explanation for distance 1: Because the bug that each bug is walking towards is always moving perpendicular to the first bug’s path, never getting closer or further away from the first bug’s motion. So it has to go exactly the same distance as it was at the beginning. For the…
Not rated yetSecrets of the lost number walls
· 36 min
This video is about number walls a very beautiful corner of mathematics that hardly anybody seems to be aware of. Time for a thorough Mathologerization :) Overall a very natural follow-on to the very popular video on difference tables from a couple of months ago ("Why don't they teach Newton's calculus of 'What comes next?'") 00:00 Intro 01:02 Chapter 1: What's in a wall 03:35 Chapter 2: Number wall oracle 14:31 Chapter 3: Walls have windows 16:34 Animations of Pagoda sequence 18:13 Chapter 4: Zero problems 25:31 Chapter 5: Determinants 32:49 Animation sequence with music 35:22 Thank you :) References for number walls The main reference for number walls is Fred Lunnon's article "The number-wall algorithm: an LFSR cookbook", Journal of Integer Sequences 4 (2001), no. 1, 01.1.1. https://cs.uwaterloo.ca/journals/JIS/VOL4/LUNNON/numbwall10.html Also check out Fred's article "The Pagoda sequence: a ramble through linear complexity, number walls, D0L sequences, finite state automata, and aperiodic tilings", Electronic Proceedings in Theoretical Computer Science 1 (2009), 130–148. https://arxiv.org/abs/0906.3286. Among many other things this one features lots of pretty pictures :) Conway and Guy's famous "The book of numbers" has a chapter dedicated to number walls. This is where I first learned about number walls. Sadly, Figure 3.24 on page 88 which describes the horse shoe rule is full of typos. Careful: 1. (formulae on right) Negate signs attached to w_l/w and e_l/e ; 2. (diagram on left) Leftward arrow missing from edge marked w_2 ; 3. The last row of arrows bears labels " s_3 " ... " s_2 " ... " s_1 " , which should instead read " s_1 " ... " s_2 " ... " s_3 " . More articles/books to check out if you are really keen: https://tinyurl.com/bdhyzscw https://core.ac.uk/download/pdf/82737163.pdf Jacek Gilewicz, Approximants de Padé, Springer Lecture Notes in Mathematics 667 (1978). The Wiki page on linear recurrence with constant coefficients is a good resource for finding out about how the characteristic polynomial of a sequence translates into a "function rule" https://en.wikipedia.org/wiki/Linear_recurrence_with_constant_coefficients Coding challenge Create an online implementation of the number wall algorithm using determinants or, ideally, using the cross and horseshoe rules and do a couple of fun things with your program. Here are some possible ideas you could play with: 1. generate pictures of even number (or, more generally, mod p) windows of random integer sequences or of sequences grabbed from here https://oeis.org/ . 2. Explore the Pagoda sequence number wall, again mod various prime numbers. Here is the entry for this sequence in the on-line Encyclopaedia of integer sequences https://tinyurl.com/yc45cfvf 3. Be inspired by the examples in this article https://arxiv.org/abs/0906.3286 Send me a link to your app before the next Mathologer video comes out and I'll enter you in the draw for a copy of Marty and my book Putting two and two together :) Research challenge Prove the Pagoda sequence wall conjecture or find a counterexample. Bug report In the video I say that figuring out the factor rule is easy. This is only true for windows of 0s of even dimensions. Showing that the factor rule has a -1 on the right side for windows of odd dimensions is actually somewhat tricky. Details in the first article by Fred Lunnon listed above. Today's music: Asturias by Isaac Albeniz performed by Guitar Classics and Taiyo (Sun) by Yuhi (Evening Sun) Today's t-shirt: Yes, I am always right. If you are interested in getting one just google "Yes, I am always right math t-shirt" and pick the version you like best. Enjoy! Burkard
Not rated yetWhy is calculus so ... EASY ?
· 38 min
Calculus made easy, the Mathologer way :) 00:00 Intro 00:49 Calculus made easy. Silvanus P. Thompson comes alive 03:12 Part 1: Car calculus 12:05 Part 2: Differential calculus, elementary functions 19:08 Part 3: Integral calculus 27:21 Part 4: Leibniz magic notation 30:02 Animations: product rule 31:43 quotient rule 32:18 powers of x 33:10 sum rule 33:52 chain rule 34:54 exponential functions 35:30 natural logarithm 35:56 sine 36:32 Leibniz notation in action 36:43 Creepy animations of Thompson and Leibniz 37:00 Thank you! Online version of Silvanus P. Thompson's book "Calculus made easy" at Project Gutenberg: https://www.gutenberg.org/ebooks/33283 There is also a version of this book annotated by the great Martin Gardner. That's the one to get if you after a hardcopy. https://www.amazon.com/Calculus-Made-Easy-Silvanus-Thompson/dp/0333772431 Paranormal distribution maths t-shirt: https://tinyurl.com/2p6x5jre for other versions of the same idea google "paranormal distribution math t-shirt" Creepy animations: https://www.myheritage.com/deep-nostalgia Music: Morning mandolin by Chris Haugen and Game changer by ikoliks. Thank you very much to Eduardo Ochs for his subtitles in Brazilian Portuguese. Burkard
Not rated yetHeron’s formula: What is the hidden meaning of 1 + 2 + 3 = 1 x 2 x 3 ?
· 26 min
Today's video is about Heron's famous formula and Brahmagupta's and Bretschneider's extensions of this formula and what these formulas have to do with that curious identity 1+2+3=1x2x3. 00:00 Intro 01:01 1+2+3=1x2x3 in action 02:11 Equilateral triangle 02:30 Golden triangle 03:09 Chapter 1: Heron 06:18 Heron's formula 08:50 Brahmagupta's formula 10:20 Bretschneider's formula 11:52 Chapter 2: How? The proof 12:57 Heron via trig 20:09 Cut-the-knot 21:16 Albrecht Hess 21:46 Heron to Brahmagupta proof animation 25:10 Thank you! Heron's formula on the Cut-the-knot site: https://www.cut-the-knot.org/Curriculum/Geometry/HeronsFormula.shtml Original article by Roger B. Nelsen "Heron's formula via proofs without words", featuring a version of the nice rectangle proof that I am presenting in this video: https://www.maa.org/sites/default/files/0746834212944.di020798.02p0691h.pdf Simple derivation of Heron's formula just using Pythagoras's theorem: https/www.mathpages.com/home/kmath196/kmath196 Job Bouwman's maths posts on Quora (you'll have to scroll a bit to get to Heron's formula) http://shorturl.at/gzGOX http://shorturl.at/dBX12 https://www.quora.com/profile/Job-Bouwman A very comprehensive book about quadrilaterals: Claudia Alsina, Roger B. Nelsen - A Cornucopia of Quadrilaterals (Dolciani Mathematical Expositions) (2020, American Mathematical Society) Albrecht Hess's paper "A Highway from Heron to Brahmagupta" https://forumgeom.fau.edu/FG2012volume12/FG201215.pdf If you liked the rectangle proof of the sum = product identity you'll probably also like this proof of Pythagoras's theorem: https://youtu.be/r4gOlttnJ_E I also mentioned this one earlier in a video on this main channel https://youtu.be/r4gOlttnJ_E Two more interesting notes on the cut-the-knot page: 1. Let the angles of the triangle be 2α, 2β, 2γ so that α + β + γ = 90°. The identity RGP = r²(R + G + P) is equivalent to the following trigonometric formula: cotα + cotβ + cotγ = cotα cotβ cotγ, where "cot" denotes the standard cotangent function. More on this here https://tinyurl.com/yrsuhthk 2. A supercute way to derive Pythagoras from Heron with one line of calculus https://www.cut-the-knot.org/pythagoras/HeronsDerivative.shtml For a cyclic quadrilateral that also has an incircle we have a+b=c+d and it follows that the area is just square root of the product of all of the sides. A 3d counterpart to Heron's formula: https://en.wikipedia.org/wiki/Heron%27s_formula#Heron-type_formula_for_the_volume_of_a_tetrahedron A different 3d connection (de Gua's theorem) https://www.mathpages.com/home/kmath226/kmath226.htm A couple of links to get you started on generalisations involving cyclic n-gons: https://arxiv.org/pdf/1203.3438.pdf https://arxiv.org/pdf/1910.08396.pdf https://tinyurl.com/tyhzwpxj Another interesting observation extending the fact that the 3-4-5 right-angled triangle has incircle radius 1: In general, the incircle radius of any right-angled triangle with integer sides is an integer. Have a look at this for a related proof that arctan 1 + arctan 2 + arctan 3 = pi: https://www.geogebra.org/m/A65eMkuN https://math.stackexchange.com/questions/197393/why-does-tan-11-tan-12-tan-13-pi (2nd proof) Not many integer solutions for x+y+z=xyz: 0+0+0=0x0x0 1+2+3=1x2x3 (-1)+(-2)+(-3)=(-1)x(-2)x(-3) Other interesting little curiosities (some mentioned in the comments): 2+2=2x2=2^2 (of course) 3^3+4^3+5^3=6^3 = 6*6*6=216 illuminati confirmed 6+9+6*9 = 69 a+9+a*9 = 10a+9 (sub any digit) https://en.wikipedia.org/wiki/Mathematical_coincidence log(1+2+3)=log(1)+log(2)+log(3) follow from 1+2+3=1x2x3 Grégoire Locqueville 2:32 "Maybe one of you can check in the comments" is the new "left as an exercise to the reader" :) Scaling the equations at this time code: https://youtu.be/IguNXoCjBEk?t=256: length, area and "volume" start out the same with radius 1: length=area=volume. When you scale by r, these values scale in this way Length = length * r, Area = area * r^2 and…
Not rated yetReinventing the magic log wheel: How was this missed for 400 years?
· 19 min
Today is about reinventing a really cool mathematical wheel and its many different slide rule incarnations, just using a rubber band. 00:00 Intro 04:40 Multiply! 06:02 Pi times e 07:15 Divide! 08:39 Sliding rules 10:53 Apollo 11:08 Star Trek 11:45 Rubber band proof 13:13 Logarithms 16:50 Dmitry's wheel 17:48 Thank you! This video was inspired by Dmitry Sagalovskiy's Wheel of logarithms. Here is his original animation: https://dsagal.github.io/circle-of-fifths/logwheel/ The source code lives here (free for you to modify) https://github.com/dsagal/circle-of-fifths/blob/master/src/logcircle.ts Dmitry's original post on Reddit with an interesting discussion section lives here: https://tinyurl.com/4dc9hb2r Dmitry's company Grist a spreadsheet-database product lives here: https://www.getgrist.com Must see, the amazing Slide Rule Simulator Emulator Replica Collection: Aristo, Faber-Castell, Pickett, ..., they are all there. https://www.sliderules.org Sadly, all these slide rules are linear slide rules. There are some circular slide rules apps made for mobile devices. However, I don't like any of them, except for the German WWII submarine Angriffsscheibe (=attack disk) app Sub Buddy which contains a circular slide rule (not free :( It would be great if one of you could make a nice circular slide rule online app. Optional features could include: 1. input fields for numbers that are multiplied or divided and then the automatic execution of the slide rule actions with the scales spinning as in this video; 2. infinite precision by making it possible to zoom in on the scales and have it refine automatically; 3. tick box for squaring, as we rotate the two inputs for multiplying are kept the same; 4. incorporation of other look-up scales or even log-log scales; 5. Change of base. :) The Wiki page on slide rules is excellent https://en.wikipedia.org/wiki/Slide_rule Don't miss out on the bottom of the page, especially the part on "Contemporary use". Nice contributions to the Mathologer coding challenge (infinite precision zoomable circular slide rule) Cristian Merighi: https://js.pacem.it/2d/circular-slide-ruler Mike Wessler: https://phoenixave.com/crule Liam Applebe: https://tiusic.com/slide_rule.html Juan Ignacio Almenara Ortiz: https://www.desmos.com/calculator/tul8psjh32 (demos) Root of evil math t-shirt: A missed opportunity squaring the root of evil using the circular slide rule to find evil :( Will do in my next life. Some of you commented that the number shown on the t-shirt was just truncated at the 4th decimal and not rounded. Well, strictly speaking it's wrong no matter whether you round or just chop off as the designer of this t-shirt did :) Nice concise summary of why the circumference of the wheel is ln(10): At any given moment, the numerical scale of the unwrapped band is proportional to 1/x, where x is the number entering the wheel. So this is a really nice way to see that the integral of 1/x is a logarithmic function. For real math gourmets: a slide rule for complex numbers :) https://demonstrations.wolfram.com/ComplexSlideRule/ Sliderule nickname: Slipstick Someone suggested another cute name: addalog computer (I like it :) And another one: dial-log Slide rule: only one child at a time (I like that one too :) German: Rechenscheibe vs. Rechenschieber (calculating disk=circular slide rule vs. calculating slider=linear slide rule) Check out what it took to win the international slide rule competition: https://www.sliderulemuseum.com/ISRC.htm Different slide rule scales: http://www.quadibloc.com/math/sr02.htm (the whole site is really amazing http://www.quadibloc.com/math/slrint.htm) A very detailed discussion of the use of circular slide rules in Star Trek: https://www.trekbbs.com/threads/props-re-used.81174/page-7 Circular slide rule in Dr Strangelove https://tinyurl.com/35tkp6uj https://www.fourmilab.ch/bombcalc/brico.html https://www.youtube.com/watch?v=zZct-itCwPE Slide rule in the movie Red October…
Not rated yetTesla’s 3-6-9 and Vortex Math: Is this really the key to the universe?
· 29 min
Today, a long overdue foray into the realm of VORTEX MATHEMATICS :) 00:00 Intro 04:16 The vortex 08:10 The maths of remainders and digital roots 13:25 Demystifying the vortex 16:30 A matter of base. The 8 fingered Tesla. 19:21 Explanation why the digital root is the remainder on division by 9 24:01 Tristan's challenge 24:44 The magic of modular multiplication maths 25:19 Intuition for multiplier - 1 petals 28:23 Thank You! Coding competition: My wish list for the modular times table diagram app: -Being able to color line segments according to length. -Indication of the "direction" of multiplication. 1x2 = 2 and so there should really be a little arrow from 1 to 2 not just a simple connection :) -different loops in different colors. ... Here is the prize, a copy of my and Marty's new book. https://bookstore.ams.org/mbk-141/ That early Mathologer video featuring the modular times tables Times Tables, Mandelbrot and the Heart of Mathematics https://youtu.be/qhbuKbxJsk8 A really nice article about various ways to generate the cardioid by Dave Richeson https://divisbyzero.com/2018/04/02/i-heart-cardioids/ Nice debunking/demystifying article about vortex math by "Professor Puzzler" https://www.theproblemsite.com/vortex/ For a growing pile of implementation of modular times table diagrams see my comment pinned to the top of the comment section of this video. Simon Plouffe's website http://plouffe.fr/Simon%20Plouffe.htm Articles by him relevant to this video can be found in this directory http://plouffe.fr/Inverseofprimes/ See in particular the files The shape of b^n mod p.pdf La forme de bn mod p.pdf What I am talking about in this video is really just the tip of a bizarre mathematical iceberg that most mathematically minded people are completely unaware of. Have a look at this presentation by Marko Rodin on vortex math (beware serious nutty and at the same time truely beautifully presented numerology ahead :) A LOT more than is usually reported on in popular YouTube videos. https://sciencetosagemagazine.com/vbm-vortex-based-mathematics-with-marko-rodin/ In turn this iceberg is just another tip of an even bigger iceberg of mainly wishful thinking. Have a look: https://sciencetosagemagazine.com/category/library/ Today's music: Aftershocks by Ardie Son Enjoy! Burkard
Not rated yetHow did Fibonacci beat the Solitaire army?
· 22 min
Fibonacci and a super pretty piece of life-and-death mathematics. What can go wrong? 00:00 Intro 02:20 Solitaire 03:12 Survivor challenge 05:32 Invasion 11:41 The triangles of death 20:22 Final animation 21:43 Thank You! Here is an online version of Marty and my newspaper article about the possible positions of one remaining peg when playing peg solitaire on various boards https://www.qedcat.com/archive_cleaned/212.html Marty and my new book "Putting two and two together" https://bookstore.ams.org/mbk-141/ Martin Aigner's paper "Moving into the desert with Fibonacci". Bit of a pain to access it for free, possible though via this site. https://www.jstor.org/stable/2691046 This paper contains the proof that I am focussing on in this video. It also has Conway's golden ratio based proof. An implementation of the solitaire army game by Mark Bensilum. Use it to play solitaire army general. Note that this implementation starts with all of the bottom squares occupied by pegs. Please read carefully how you are supposed to play the game using this app :) https://www.cleverlearning.co.uk/blogs/blogConwayInteractive.php The paper "The minimum size required of a solitaire army" by George I. Bell, Daniel S. Hirschberg, Pablo Guerrero-Garcia considers all sorts of variations of the basic solitaire army game. The animation and challenge at the end of the video is based on some of the findings in this paper. Highly recommended. https://arxiv.org/pdf/math/0612612.pdf Reaching row 5 in Solitaire Army using infinitely many pegs (featuring a pretty spectacular animation at the bottom of the page) by Simon Tatham and Gareth Taylor https://www.chiark.greenend.org.uk/~sgtatham/solarmy/ A page of very interesting solitaire-army puzzles by Luciano Gualà, Stefano Leucci, Emanuele Natale, and Roberto Tauraso https://www.isnphard.com/g/solitaire-army/ Numberphile videos on "Conway's checkers" starring the mathematician Zvezdelina Stankova https://youtu.be/FtNWzlfEQgY https://youtu.be/Or0uWM9bT5w Today's t-shirt: https://teeherivar.com/product/funny-math-fibonacchos/ Today's music: I promise by Ian Post Enjoy! Burkard
Not rated yetThe 3-4-7 miracle. Why is this one not super famous?
· 23 min
I got sidetracked again by a puzzling little mathematical miracle. And, as usual, I could not help myself and just had to figure it out. Here is the result of my efforts. 00:00 Intro 08:45 The Coin rotation paradox 16:00 Mystery number explanation 18:38 Challenges and the new book 19:53 One-minute animation on how to figure the sum of the angles in a star 21:04 Thank you :) The winner of Marty and my book Putting Two and Two together is Alexander Svorre Jordan. Congratulations. :) Thank you again to everybody who submitted an implementation of the dance. Here are five particularly noteworthy submissions: (Kieran Clancy) https://kieranclancy.github.io/star-animation/ (this was the very first submission submitted in record time :) (Liam Applebe) https://tiusic.com/magic_star_anim.html (an early submission that automatically does the whole dance for any choice of parameters) (Pierre Lancien) https://lab.toxicode.fr/spirograph/ (with geared circles) (Christopher Gallegos) https://gallegosaudio.com/MathologerStars (very slick interface) (Matthew Arcus) https://www.shadertoy.com/view/7tKXWy (implements the fact that BOTH types of rotating polygons are parts of circles rolling around DIFFERENT large circles) Some fun and helpful links. The animation in geogebra (by Juan Carlos Ponce Campuzano): https://www.geogebra.org/m/tfqmub4g The version of the animation I show in the video I stumbled across on Instagram, Twitter, etc.: https://tinyurl.com/36dy6nm3 The new book by Marty and me: https://bookstore.ams.org/mbk-141 New short videos on Mathologer 2: https://www.youtube.com/c/Mathologer2 New Mathologer instagram account: https://www.instagram.com/the_real_mathologer/ Hypotrochoids: https://en.wikipedia.org/wiki/Hypotrochoid https://www.geogebra.org/m/pTrc52nv Spirograph: https://en.wikipedia.org/wiki/Spirograph (a nice app) https://faishasj.github.io/spirograph/ Coin rotation paradox https://en.wikipedia.org/wiki/Coin_rotation_paradox Tusi couple: https://en.wikipedia.org/wiki/Tusi_couple Funfair Twister ride: https://www.youtube.com/watch?v=laQeA47NN0E Today's music is Altitude by Muted. Enjoy! Burkard
Not rated yetDo you understand this viral very good math movie clip? (Nathan solves math problem X+Y)
· 15 min
Recently one of you requested that I explain the math(s) in this clip which recently went viral. https://youtu.be/mYAahN1G8Y8 It's a clip taken from the movie X+Y aka A brilliant young mind. The math(s) problem that Nathan, the main character in this movie, is working on in this clip is a simplified version of the first part of a problem that was shortlisted for the 2009 International Mathematical Olympiad. Here is a link to the shortlist. https://www.imo-official.org/problems/IMO2009SL.pdf The problem in question is problem C1 (the number 50 in the problem has been replace by the number 2 in the clip). This problem was suggested to the makers of the movie by Lee Zhao one of the maths consultants of the movie. This Note that the file I've linked to ere also includes solutions. This problem was invented by Michael Albert who is a mathematician and computer scientist working at the University of Otago in New Zealand. https://en.wikipedia.org/wiki/Michael_H._Albert The 4-colour puzzle that I am challenging you with at the end of this video was invented specifically for the movie X+Y by the U.K. mathematician Geoff Smith who was another math consultant for the movie. https://en.wikipedia.org/wiki/Geoff_Smith_(mathematician) Geoff Smith also served for many years as the leader of the United Kingdom team at the International Mathematical Olympiad and is the current president of the IMO board. He also appears in a cameo role in the movie. He is sitting next to Nathan's mother in the corridor outside the hall in which the math(s) olympiad is taking place at the end of the movie. https://imgur.com/a/cjWLHKi Here is scan of the fictional IMO questions that the students dealing with at the end of the movie. https://imgur.com/a/C1Uxkbd Actually they adapted the first problem a little bit to make it fit in better with the story https://imgur.com/a/9lP4zKe These questions and their solutions also appear in the book by Geoff Smith, A Mathematical Olympiad Companion UK Mathematics Trust https://www.ukmt.org.uk/product/95 Here is my presentation of an animated solution of the 4-color problem on Mathologer 2. https://youtu.be/4uQfY8NSM6w Please also check the description of that video for more information and the announcement of the winner(s) of the t-shirt. Thank you very much to my colleague Norman Do for digging out all this info about the origins of these problems. Marty and my MMDB (Mathematical Movie Data Base) lives here https://www.qedcat.com/moviemath/ Here is the preview of Marty and my book Math goes to the movies on Google books (features a couple chapters) https://tinyurl.com/f57wr72v The music accompanying my Thank you at the end is I Promise by Ian Post (just like for the last video) Enjoy! Burkard P.S.: Here is a great account featuring an ex IMO participant who contributed to the making of X+Y. https://ncs6mathssociety.wordpress.com/2015/09/09/lee-zhou-zhao-visits-the-ncs/ His name is Lee Zhou Zhao. He also made a cameo appearance in the movie https://imgur.com/a/uFwS8Yv
Not rated yetWhy don't they teach Newton's calculus of 'What comes next?'
· 47 min
Another long one. Obviously not for the faint of heart :) Anyway, this one is about the beautiful discrete counterpart of calculus, the calculus of sequences or the calculus of differences. Pretty much like in Alice's Wonderland things are strangely familiar and yet very different in this alternate reality calculus. Featuring the Newton-Gregory interpolation formula, a powerful what comes next oracle, and some very off-the-beaten track spottings of some all-time favourites such as the Fibonacci sequence, Pascal's triangle and Maclaurin series. 00:00 Intro 05:16 Derivative = difference 08:37 What's the difference 16:03 The Master formula 18:19 What's next is silly 22:05 Gregory Newton works for everything 28:15 Integral = Sum 32:52 Differential equation = Difference equation 36:06 Summary and real world application 39:22 Proof Here is a very nice write-up by David Gleich with a particular focus on the use of falling powers. https://tinyurl.com/ymcyrapz This is a nice lesson from a Coursera course on this topic https://www.coursera.org/lecture/discrete-calculus/differences-k4jBq One volume of Schaum's outlines is dedicated to "The calculus of finite differences and difference equations" (by Murray R. Spiegel) Examples galore! This is a really nice very old book Calculus Of Finite Differences by George Boole (published in 1860!) https://tinyurl.com/3bdjr932 Thanks to Ian Robertson for recommending this one. There is a wiki page about our mystery sequence: https://tinyurl.com/uwc89yub It's got a proof for why the mystery sequence counts the maximal numbers of regions cut by those cutting lines. If you have access to the book "The book of Numbers" by John Conway and Richard Guy, it's got the best proof I am aware of. Here is a sketch of how you solve the Fibonacci difference equation to find Binet's formula https://imgur.com/a/Btu5ZVk Here are a couple more beautiful gems that I did not get around to mentioning: 1. When we evaluate the G-N formula for 2^n what we are really doing is adding the entries in the nth row of Pascal's triangle (which starts with a 0th row :) And, of course, adding these entries really gives 2^n. 2. Evaluating the G-F formula for 2^n at n= -1 gives 1-1+1-1+... which diverges but whose Cesaro sum is 2^(-1)=1/2!! Something similar happens for n=-2. 3. In the proof at the end we also show that the difference of n choose m is n choose m-1. This implies immediately that the difference of the mth falling power is m times the difference of the m-1st falling power. Today's music is by "I promise" by Ian Post. Enjoy! Burkard P.S.: Some typos and bloopers https://youtu.be/4AuV93LOPcE?t=719 (396 should be 369) https://youtu.be/4AuV93LOPcE?t=1709 (where did the 5 go?) https://youtu.be/4AuV93LOPcE?t=2448 (a new kind of math(s) :)
Not rated yetThe Iron Man hyperspace formula really works (hypercube visualising, Euler's n-D polyhedron formula)
· 30 min
On the menu today are some very nice mathematical miracles clustered around the notion of mathematical higher-dimensional spaces, all tied together by the powers of (x+2). Very mysterious :) Some things to look forward to: The counterparts of Euler's polyhedron formula in all dimensions, a great mathematical moment in the movie Iron man 2, making proper sense of hupercubes, higher-dimensional shadow play and a pile of pretty proofs. 00:00 Intro 01:17 Chapter 1: Iron man 06:05 Chapter 2: Towel man 11:16 Cauchy's proof of Euler's polyhedron formula 17:37 Chapter 3: Beard man 22:16 Tristans proof that (x+2)^n works 26:16 Chapter 4: No man 28:52 Shadows of spinning cubes animation 28:42 Thanks Here is a link to a zip file with the Mathematica notebooks for creating the cube and hypercube shadows that I discuss at the end of the video in chapter 4. https://www.qedcat.com/cube_hypercube.zip If you don't have Mathematica, you can have a look at pdf versions of the programs that are also part of the zip archive or you can use the free CDF player to open the cdf versions of the notebooks. Something I forgot to mention: There is also another purely algebraic incarnations of this process of growing the cubes. It comes in the form of a recursion formula that connects the different numbers of bits and pieces in consecutive dimensions. That recursion formula is also present at the bottom of the "iron man page". Have a close look :) Also, in the Marvel movies the cube that Tony Stark is holding in the thumbnail of this video is called the Tesseract. Probably worth pointing out that "tesseract" is another name for a 4-d cube. I also built an easter egg into the thumbnail that plays on this fact: https://imgur.com/a/psIy28k The formulae for n-d tetrahedra and octahedra can be found on this page; https://people.math.osu.edu/fiedorowicz.1/math655/HyperEuler.html Here is a link to my video on solving the 4d Hyper Rubik's Cube https://youtu.be/yhPH1369OWc Another proof of Moessner for cubes using cubical shells Anthony Harradine and Anita Ponsaing https://www.qedcat.com/StrikeMeOut.pdf Here is a really nice video on the 120-cell that I only mentioned in passing. https://youtu.be/MFXRRW9goTs Noteworthy from the comments: Today's video was "triggered" by a comment made by Godfrey Pigott on the last video on Moessner's miracle in which he pointed out that (x+2)^n captures the vital statistics of the n-dimensional cube. Z. Michael Gehlke There is an easy way to see this: (x^1 + 2*x^0) describes the parts of a line; all of the cubes are iterated products of lines: n-cube = (1-cube)^n. Therefore, all cubes are described by iterated powers of (x^1 + 2*x^0)^n. (Me: Nice insight. Of course needs some fleshing out to make this work on it's own, like in the comment by ... HEHEHE I AM A SUPAHSTAR SAGA I came up with an even simpler visual proof. Take a cube of side length x+2. This cube has a volume (x+2)^3. Now, slice the cube six times. Each slicing plane is parallel to a face and 1 unit deeper than the face. Don't throw away any volume. What you're left with is an inner cube of side length x (volume x^3), 6 square pieces of volume x^2, 12 edge pieces of volume x, and 8 corner cubes with volume 1 each. Adding up these volumes gives you the original (x+2)^3 volume, so it's proven. This works in any dimension. Here is a link to an animation of this idea that I put on Mathologer 2, as a reward to those of you who who are keen enough to actually read these descriptions. https://youtu.be/cAVvwmcKsFk Typo: The numbers of vertices and faces of the dodecahedron got switched. Today's music is Floating Branch by Muted. Enjoy! Burkard
Not rated yetThe Moessner Miracle. Why wasn't this discovered for over 2000 years?
· 25 min
Today's video is about a mathematical gem that was discovered 70 years ago. Although it's been around for quite a while and it's super cool and it's super accessible, hardly anybody knows about it. 00:00 Intro 04:58 Chapter 1: Making our own proof 09:55 Chapter 2: Some more amazing facts 13:11 Chapter 3: Post's proof 23:36 Supporters If after watching this video you'd like to find out more about Moessner's result, the following PhD thesis features a very comprehensive bibliography: https://ebooks.au.dk/aul/catalog/book/213 The proof by Karel Post that I matholologerise in the second half of this video is contained in this paper: Karel A. Post. Moessnerian theorems. How to prove them by simple graph theoretical inspection. Elemente der Mathematik, (2):46–51, 1990. Post also proves a couple of generalisations of Moessner's theorem. Another good write-up of the same proof can be found in Ross Honsberger"s 1991 book More Mathematical Morsels. Honsberger says about Moessner that "he was internationally known in the field of recreational mathematics for many spectacular results in arithmetic". Have to have a closer look at some point at what else exactly he did :) Post's article can be accessed here: https://www.e-periodica.ch (search for "Moessnerian theorems"). Sadly most other articles about Moessner's theorem are located behind paywalls. Here is another very pretty proof of the basic cubes result by Anthony Harradine and Anita Ponsaing using actual 3d cubical shells https://www.qedcat.com/misc/StrikeMeOut.pdf It's well worth exploring further than what I get around to reporting in this video. If you do, you'll discover interesting connections with super-factorials, higher-dimensional counterparts of Pascal's triangle, and so on. Challenge for the programmers among you: write a program that turns a sequence of highlighted integers into the corresponding Moessner sequence. Today's music is "Just Jump" by Ian Post. If you are interested in the t-shirt google "math whisperer t-shirt". If you don't understand the math whisperer bit, you did not watch the video to the end :) Enjoy! Burkard 14. Sep. 2021: I just added Russian subtitles prepared by Michael Didenko. Thank you very much Michael.
Not rated yetThe Pigeon Hole Principle: 7 gorgeous proofs
· 33 min
Let's say there are more pigeons than pigeon holes. Then, if all the pigeons are in the holes, at least one of the holes must house at least two of the pigeons. Completely obvious. However, this unassuming pigeon hole principle strikes all over mathematics and yields some really surprising, deep and beautiful results. In this video I present my favourite seven applications of the pigeon hole principle. Starting with a classic, the puzzle of hairy twins, we then have a problem with pigeons on a sphere, a pigeon powered explanation of recurring decimals, some party maths, a very twisty property of the Rubik’s cube, a puzzler from the 1972 International Mathematical Olympiad, and, finally, what some people consider to be the best mathematical card trick of all time. 00:00 Intro 01:49 Chapter 1: Hairy twins 06:46 Chapter 2: Five pigeons on a sphere 08:16 Chapter 3: Repeating decimals 13:14 Chapter 4: Partying pigeons 17:00 Chapter 5: Repeating Rubik 22:20 Chapter 6: Pigeons at the Olympiad 26:18 Chapter 7: The best mathematical card trick ever 31:24 Supporters Here are some links for you to explore. A scanned copy of Récréation mathématique: Composée de plusieurs problèmes plaisants et ... by Jean Leurechon on Google books. For the hair puzzle check out page 130) https://tinyurl.com/3b6amaxk The Pigeonhole Principle, Two Centuries Before Dirichlet by Albrecht Heeffer and Benoit Rittaud A very nice article about the origins of the pigeon principle and the hairy twins problem. Also features an English translation of the relevant page in Récréation mathématique https://tinyurl.com/hpkcuepx The 4/5 pigeons in a hemisphere puzzle was problem A2 of the 63rd Putnam competition in 2002 https://prase.cz/kalva/putnam/psoln/psol022.html Why are repeated decimals fractions? Watch this video on why 9.999... =10 for a big hint https://youtu.be/SDtFBSjNmm0 Or just skip straight to the answer https://en.wikipedia.org/wiki/Decimal_representation#Conversion_to_fraction If you don't own a Rubik's cube you can use this simulator to test what happens when you repeat some algorithms (move the faces using the keyboard) https://ruwix.com/online-puzzle-simulators/ The website of the International Mathematical Olympiad. https://www.imo-official.org . The problem I am considering in this video is Problem 1 of the 1972 olympiad. You can download all the problems from here. https://www.imo-official.org/problems.aspx Check out this very nice article about the Fitch Cheney five-card trick by Colm Mulcahy https://tinyurl.com/wttkfdwe Today's music is English Country Garden (and as usual Morning Mandolin at the end) from the free YouTube music library. Today's t-shirt I got from here https://www.theshirtlist.com/pizzibonacci-t-shirt/ Enjoy! Burkard
Not rated yetThe ultimate tower of Hanoi algorithm
· 39 min
There must be millions of people who have heard of the Tower of Hanoi puzzle and the simple algorithm that generates the simplest solution. But what happens when you are playing the game not with three pegs, as in the original puzzle, but with 4, 5, 6 etc. pegs? Hardly anybody seems to know that there are also really really beautiful solutions which are believed to be optimal but whose optimality has only been proved for four pegs. Even less people know that you can boil down all these optimal solutions into simple no-brainer recipes that allow you to effortless execute these solutions from scratch. Clearly a job for the Mathologer. Get ready to dazzle your computer science friends :) I also talk about 466/885, the Power of Hanoi constant and a number of other Hanoi facts off the beaten track. And the whole thing has a Dr Who hook which is also very cute. 00:00 Intro 01:58 Chapter 1: The doctor vs. the toymaker 14:27 Chapter 2: Hanoi constant 21:21 Chapter 3: The Reve's puzzle 28:04 A beautiful shortest solution for 10 discs and 4 pegs (discs and super-disks) 30:23 Chapter 4: Unprovable algorithm 35:43 A beautiful shortest solution for 10 discs and 5 pegs (discs, super-discs and super-super-discs) 37:17 Supporters Here are some references for you to check out: Andreas M. Hinz et al. - The Tower of Hanoi – Myths and Maths, 2nd edition (2018, Birkhäuser Basel) That's the book I mentioned in the video. The Dr Who episode (well the part that's not been lost) https://www.dailymotion.com/video/x119oe7 The 3Blue1Brown video that I mention https://youtu.be/2SUvWfNJSsM Thierry Bousch, La quatrième tour de Hanoi, http://tinyurl.com/4p3fudu7 That's the paper that pins down things for four pegs. Andreas M. Hinz, Dudeney and Frame-Stewart Numbers, A nice paper explaining the connection between Dudeneys's work and Frame-Stewart. Also worth reading for the historical details. http://tinyurl.com/t8xb2e5t A. van de Liefvoort, An Iterative Algorithm for the Reve's Puzzle, http://tinyurl.com/h5cxfy5u I found this one useful. Paul K. Stockmeyer, http://www.cs.wm.edu/~pkstoc/toh.html A couple of very nice papers including a huge bibliography. Ben Houston & Hassan Masum, Explorations in 4-peg Tower of Hanoi, tinyurl.com/mw95tnek This paper has some pictures of state graphs for the 4-peg puzzle. http://towersofhanoi.info/Animate.aspx Very fancy animation of mulit-peg tower of Hanoi. Sadly, it just comes across as a mess of moves for more than three pegs. Programmers, you really should rise to my challenge to animate the 4-peg algorithm the way I present it in this video. Here is the link to the wiki page for the Celestial toymaker Dr Who episode https://en.wikipedia.org/wiki/The_Celestial_Toymaker Makes very interesting reading. Especially the fact that most of this episode has been lost I find pretty amazing. That's also why I only show a still image from the relevant part of the episode and play some audio snippet. Music: Fresh Fallen Snow and Morning Mandolin both by Chris Haugen, Mumbai effect. All from the free YouTube audio library. Enjoy! Burkard
Not rated yetExplaining the bizarre pattern in making change for a googol dollars (infinite generating functions)
· 30 min
Okay, as it says in the title of this video, today's mission is to figure out how many ways there are to make change for one googol, that is 10^100 dollars. The very strange patterns in the answer will surprise, as will the explanation for this phenomenon, promise. 0:00 Intro 1:15 Chapter 1: curious count 9:05 Chapter 2: googol 14:10 Chapter 3: infinite change 28:41 Acknowledgements A very nice Mathematica file created by Andrew Neitsch in 2005 covers pretty much every aspect of change making mathematics. http://andrew.neitsch.ca/publications/m496pres1.nb Here is a pdf version of this file: https://andrew.neitsch.ca/publications/m496pres1.nb.pdf What I cover in the last part of this video is pretty much fleshing out and animating the section "Coin change revisited". All this is part of to Andrew's answer to a post on math.stackoverflow https://stackoverflow.com/questions/1106929/how-to-find-all-combinations-of-coins-when-given-some-dollar-value The visual algebra approach to calculate the number of ways to make change at the very beginning of this video was inspired by this article G. Pólya, On Picture-Writing, Am Math Monthly 63 (1956), 689-697. https://www.jstor.org/stable/2309555 Concrete mathematics by Graham, Knuth and Patashnik, the book I mentioned at the end of the video does the whole analysis for the coin set 1, 5, 10, 25, 50 (so no dollar coins). A complete list of all the different ways to make change for a dollar appears in this post https://www.maa.org/frank-morgans-math-chat-293-ways-to-make-change-for-a-dollar The book "Generatingfunctionology" by Herbert Wilf, is a great intro to generating functions :) https://www2.math.upenn.edu/~wilf/DownldGF.html Ron Graham to who this video is dedicated did a couple of videos with Numberphile. So if you'd like to see him in action, check out those videos. A lot of other interesting articles about Ron Graham can be found on his wife's (also a math professor) website. http://www.math.ucsd.edu/~fan/ron/ As usual the music in the video is from the free YouTube audio library: No. 2 Remembering her by Ester Abrami, Morning Mandolin by Chris Haugen, First time experience and T'is the season by Nate Blaze Today's t-shirts: google "only half evil t-shirt". Enjoy! Burkard
Not rated yetThe ARCTIC CIRCLE THEOREM or Why do physicists play dominoes?
· 51 min
I only stumbled across the amazing arctic circle theorem a couple of months ago while preparing the video on Euler's pentagonal theorem. A perfect topic for a Christmas video. Before I forget, the winner of the lucky draw announced in my last video is Zachary Kaplan. He wins a copy of my book Q.E.D. Beauty in mathematical proof. 00:00 Intro 00:35 Chapter 1: mutilated chessboards 07:23 Chapter 2: Monster formula 15:12 Chapter 3: Aztec gold 20:07 Chapter 4: Square dance 30:41 Chapter 5: Ice 34:35 Chapter 6: Hexagon 38:25 Credits 40:46 Mini masterclass In response to my challenge here are some nice implementations of the dance: Dmytro Fedoriaka: http://fedimser.github.io/adt/adt.html (special feature: also calculates pi based on random tilings. First program contributed.) Viktor Chlumský https://youtu.be/CCL77BUymSY (no program but a VERY beautiful animation made with the software Shadron by Victor) Cannot fit any more links in this description because of the character limit. For lots of other amazing implementations check out the list in my comment pinned to the top of the comment section of the video. For the most accessible exposition of iterated shuffling that I am aware of have a look at the relevant chapter in the book "Integer partitions" by Andrews and Eriksson. They also have a nice set of exercises that walk you through proofs for the properties of iterated shuffling that I mention in this video. I used Dan Romik's old Mac program "ASM Simulator" to produce the movie of the random tilings of growing Aztec diamond boards https://www.math.ucdavis.edu/~romik/software/ Sadly this program does not work on modern Macs. The arctic heart at the end of the video is a "chistmasized" version of an image from the article "What is a Dimer" by Richard Kenyon and Andrei Okounkov https://www.ams.org/notices/200503/what-is.pdf Thank you for letting me use this image. Around the same time that Kasteleyn published the paper I showed in the video, the physicists Temperley and Fisher published similar results, Dimer problem in statistical mechanics-an exact result, Philosophical Magazine, 6:68, (1961) 1061-1063. The way Kasteleyn as well as Temperley and Fisher calculated the numbers of tilings of boards with square tiles was a bit more complicated than the nice refinement that I show in the video which is due to Jerome K. Percus, One more technique for the dimer problem. J. Mathematical Phys., 10:1881–1888, 1969. Some great articles and websites to check out: A very accessible introduction to domino and other tilings by Federico Adila and Richard Stanley http://www.claymath.org/library/senior_scholars/stanley_ardila_tilings.pdf An accessible article about tilings with rectangles by my colleague Norm Do at Monash Uni. In particular, it's got some more good stuff about the maths of fault lines in tilings that I only hinted at in the video: http://users.monash.edu/~normd/documents/Mathellaneous-07.pdf A nice article about Kasteleyn's method by James Propp. Includes a proof of the crazy formula https://arxiv.org/abs/1405.2615 A fantastic survey article about enumeration of tilings by James Propp. This one's got everything imaginable domino and otherwise. Also the bibliography at the end is very comprehensive http://faculty.uml.edu/jpropp/eot.pdf An introduction to the dimer model by Richard Kenyon https://arxiv.org/abs/math/0310326 Alternating sign matrices and domino tilings by Noam Elkies, Greg Kuperberg, Michael Larsen, James Propp https://arxiv.org/abs/math/9201305 Random Domino Tilings and the Arctic Circle Theorem by William Jockusch, James Propp, and Peter Shor https://arxiv.org/abs/math/9801068 A website by Alexei Borodin full of amazing 3d representations of domino tilings. A must-see http://math.mit.edu/~borodin/aztec.html James Propp's name pops up a couple of times throughout this video and in this description. He's one of the mathematicians who discovered all the beautiful arctic mathematics that I am talking…
Not rated yet700 years of secrets of the Sum of Sums (paradoxical harmonic series)
· 46 min
Today's video is about the harmonic series 1+1/2+1/3+... . Apart from all the usual bits (done right and animated :) I've included a lot of the amazing properties of this prototypical infinite series that hardly anybody knows about. Enjoy, and if you are teaching this stuff, I hope you'll find something interesting to add to your repertoire! 00:00 Intro 01:00 Chapter 1: Balanced warm-up 03:26 Chapter 2: The leaning tower of maths 12:03 Chapter 3: Finite or infinite 15:33 Chapter 4: Terrible aim 20:44 Chapter 5: It gets better and better 29:43 Chapter 6: Thinner and thinner 42:54 Kempner's proof animation 44:22 Credits Here are some references to get you started if you'd like to dig deeper into any of the stuff that I covered in this video. Most of these articles you can read for free on JSTOR. Chapter 2: Leaning tower of lire and crazy maximal overhang stacks Leaning Tower of Lire. Paul B. Johnson American Journal of Physics 23 (1955), 240 Maximum overhang. Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick https://arxiv.org/abs/0707.0093 Worm on a rubber band paradox: https://en.wikipedia.org/wiki/Ant_on_a_rubber_rope Chapter 3: Proof of divergence Here is a nice collection of different proofs for the divergence of the harmonic series http://scipp.ucsc.edu/~haber/archives/physics116A10/harmapa.pdf Chapter 4: No integer partial sums A harmonikus sorrol, J. KUERSCHAK, Matematikai es fizikai lapok 27 (1918), 299-300 Partial sums of series that cannot be an integer. Thomas J. Osler, The Mathematical Gazette 96 (2012), 515-519 Representing positive rational numbers as finite sums of reciprocals of distinct positive integers http://www.math.ucsd.edu/~ronspubs/64_07_reciprocals.pdf Chapter 5: Log formula for the partial sums and gamma Partial Sums of the Harmonic Series. R. P. Boas, Jr. and J. W. Wrench, Jr. The American Mathematical Monthly 78 (1971), 864-870 Chapter 6: Kempner's no 9s series: Kempner in an online comic https://www.smbc-comics.com/comic/math-translations A very nice list of different sums contained in the harmonic series https://en.wikipedia.org/wiki/List_of_sums_of_reciprocals Sums of Reciprocals of Integers Missing a Given Digit, Robert Baillie, The American Mathematical Monthly 86 (1979), 372-374 A Curious Convergent Series. A. J. Kempner, The American Mathematical Monthly 21 (1914), 48-50 Summing the curious series of Kempner and Irwin. Robert Baillie, https://arxiv.org/abs/0806.4410 If you still know how to read :) I recommend you read the very good book Gamma by Julian Havil. Bug alert: Here https://youtu.be/vQE6-PLcGwU?t=4019 I say "at lest ten 9s series". That should be "at most ten 9s series" Today's music (as usual from the free YouTube music library): Morning mandolin (Chris Haugen), Fresh fallen snow (Chris Haugen), Night snow (Asher Fulero), Believer (Silent Partner) Today's t-shirt: https://rocketfactorytshirts.com/are-we-there-yet-mens-t-shirt/ Enjoy! Burkard Two ways to support Mathologer Mathologer Patreon: https://www.patreon.com/mathologer Mathologer PayPal: paypal.me/mathologer (see the Patreon page for details)
Not rated yetThe hardest "What comes next?" (Euler's pentagonal formula)
· 53 min
Looks like I just cannot do short videos anymore. Another long one :) In fact, a new record in terms of the slideshow: 547 slides! This video is about one or my all-time favourite theorems in math(s): Euler's amazing pentagonal number theorem, it's unexpected connection to a prime number detector, the crazy infinite refinement of the Fibonacci growth rule into a growth rule for the partition numbers, etc. All math(s) mega star material, featuring guest appearances by Ramanujan, Hardy and Rademacher, and the "first substantial" American theorem by Fabian Franklin. 00:00 Intro 02:39 Chapter 1: Warmup 05:29 Chapter 2: Partition numbers can be deceiving 16:19 Chapter 3: Euler's twisted machine 20:19 Chapter 4: Triangular, square and pentagonal numbers 24:35 Chapter 5: The Ramanujan-Hardy-Rademacher formula 29:27 Chapter 6: Euler's pentagonal number theorem (proof part 1) 42:00 Chapter 7: Euler's machine (proof part 2) 50:00 Credits Here are some links and other references if you interested in digging deeper. This is the paper by Bjorn Poonen and Michael Rubenstein about the 1 2 4 8 16 30 sequence: http://www-math.mit.edu/~poonen/papers/ngon.pdf The nicest introduction to integer partitions I know of is this book by George E. Andrews and Kimmo Eriksson - Integer Partitions (2004, Cambridge University Press) The generating function free visual proofs in the last two chapters of this vides were inspired by the chapter on the pentagonal number theorem in this book and the set of exercises following it. Some very nice online write-ups featuring the usual generating function magic: Dick Koch (uni Oregon) https://tinyurl.com/yxe3nch3 James Tanton (MAA) https://tinyurl.com/y5xj2dmb A timeline of Euler's discovery of all the maths that I touch upon in this video: https://imgur.com/a/Ko3mnDi Check out the translation of one of Euler's papers (about the "modified" machine): https://tinyurl.com/y5wlmtgb Euler's paper talks about the "modified machine" as does Tanton in the last part of his write-up. Another nice insight about the tweaked machine: a positive integer is called “perfect” if all its factors sum except for the largest factor sum to the number (6, 28, 496, ...). This means that we can also use the tweaked machine as a perfect number detector :) Enjoy! Burkard Today's bug report: I got the formula for the number of regions slightly wrong in the video. It needs to be adjusted by +n. In their paper Poonen and Rubenstein count the number of regions that a regular n-gon is divided into by their diagonals. So this formula misses out on the n regions that have a circle segment as one of their boundaries. The two pieces of music that I've used in this video are 'Tis the season and First time experience by Nate Blaze, both from the free YouTube audio library. As I said in the video, today's t-shirt is brand new. I put it in the t-shirt shop. Also happy for you to print your own if that works out cheaper for you: https://imgur.com/a/ry6dwJy All the best, burkard Two ways to support Mathologer Mathologer Patreon: https://www.patreon.com/mathologer Mathologer PayPal: paypal.me/mathologer (see the Patreon page for details)
Not rated yet