Sophie Maclean on Euclid's Algorithm

In the comments Wyatt Stevens points out that Euclid's algorithm is basically extracting the continued fraction for the quotient, so the successive approximants are going to do that thing. 

See Braids, Permutations, Representations, Continued Fraction Expansions and Models of Typed Lambda Calculus

See also Numberphile - Sophie Maclean on the Catalan Numbers.

They did one with Tony Padilla on Zeckendorf's Theorem last week: Zeckendorf's theorem states that every positive integer can be represented uniquely as the sum of one or more distinct Fibonacci numbers in such a way that the sum does not include any two consecutive Fibonacci numbers.

Subscribe to Numberphile

Matt Parker on the Binet Formula and complex numbers:

Subscribe to Stand-up Maths

Maybe maths is like a 4D climbing wall,...

Subscribe to Tibees

Comments

Popular posts from this blog

Steven Johnson - So You Think You Know How to Take Derivatives?

Hitachi HD44780U LCD Display Fonts

Using Pipewire to Make A Music Synthesizer