What is a Bézier curve? Programmers use them everyday for graphic design, animation timing, SVG, and more. #shorts #animation #programming Animated Bézier https://www.jasondavies.com/animated-bezier/
From playlist CS101
BM10.1. The Euclidean Algorithm for the Integers
Basic Methods: Revisiting the proof of Bezout's Identity, we give an algorithm for computing gcd(m, n) without factoring m and n. In turn, the Euclidean algorithm provides a method for finding the coefficients in Bezout's identity.
From playlist Math Major Basics
Euclid's algorithm and Bezout's identity
In this video we do some examples of Euclid's algorithm and we reverse Euclid's algorithm to find a solution of Bezout's identity. At the end of the video we prove a fundamental consequence of Bezout's identity, namely Euclid's lemma which will be a fundamental ingredient in the proof of t
From playlist Number Theory and Geometry
Polynumbers and de Casteljau Bezier curves | Algebraic Calculus and dCB curves | N J Wildberger
The Algebraic Calculus is an exciting new approach to calculus, not reliant on "infinite processes" and "real numbers". The central objects are polynomially parametrized curve, which turn out to be the same as the de Casteljau Bezier curves which play such a big role in design, animation,
From playlist Algebraic Calculus One Info
Lec 11 | MIT 6.451 Principles of Digital Communication II
Reed-Solomon Codes View the complete course: http://ocw.mit.edu/6-451S05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT 6.451 Principles of Digital Communication II
A final game with Elwyn Berlekamp (Amazons) - Numberphile
The legendary Elwyn Berlekamp died on April 9, 2019. In a final filming session with Numberphile, the games expert taught us how to play Amazons. More links in full description below ↓↓↓ Extras from this interview: https://youtu.be/mTl7W18UwFM Dots & Boxes with Elwyn: https://www.youtube
From playlist Director's Cut on Numberphile
Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm
This is the fourth in a series of computer science videos about the graph data structure. This is an explanation of Dijkstra’s algorithm for finding the shortest path between one vertex in a graph and another. Indeed, this explains how Dijkstra’s shortest path algorithm generates a set o
From playlist Path Finding Algorithms
Coding a Bezier curve from scratch!
This topic has been much requested, so I finally decided to make a video about it. Bezier curves are used throughout computer graphics and in engineering in general. Most software packages implement curves like these out of the box, but if you want to really get the most out of them then
From playlist Tools
Arthur Terlep - Waving Goodbye to Berlekamp - G4G14 Apr 2022
New ways to approximate Euclidean space using a network structure that produces shadows. Introduces the Umbral Distance Transform.
From playlist G4G14 Videos
Lec 12 | MIT 6.451 Principles of Digital Communication II
Reed-Solomon Codes View the complete course: http://ocw.mit.edu/6-451S05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT 6.451 Principles of Digital Communication II
Abstract Algebra: Bézout's Identity
In this video, we learn how to find the gcd of two integers A and B, and then compute integers u and v such that uA + vB = gcd(A,B). Link to the previous video (Euclidean Algorithm and GCD): http://www.youtube.com/watch?v=HNCyX3anEsc
From playlist Abstract Algebra
How to always win at Dots and Boxes - Numberphile
This video features 'games legend' Elwyn Berlekamp. Amazons with Elwyn: https://youtu.be/kjSOSeRZVNg More links & stuff in full description below ↓↓↓ Elwyn's book on Dots and Boxes: http://bit.ly/DotsBoxesBook Elwyn's Winning Ways on Amazon: http://amzn.to/1BIA6UB Extra footage about bigg
From playlist Director's Cut on Numberphile
Extended Euclidean Algorithm to Solve Linear Diophantine Equation
#shorts #mathonshorts Check out the videos on the GCD, Euclidean algorithms here Two Basic Theorems on gcd (Greatest Common Divisors) of Two Integers (Bezout's Identity) https://youtu.be/mQMksLNscY4 An Example of GCD, and Extended Euclidean Algorithm In Finding the Bezout Coefficients h
From playlist Elementary Number Theory
HACKENBUSH: a window to a new world of math
A playful venture into the vast and mysterious forests of combinatorial game theory. This one simple game will change the way you look at numbers forever! Hackenbush is easy to pick up, but exploring its strategy leads us down a fantastical mathematical rabbit hole, through which can be f
From playlist Summer of Math Exposition Youtube Videos
A Tribute to Berlekamp, Conway, Guy, Graham, and Randi - G4G14 Apr 2022
In the long four years between G4G13 and G4G14, we lost some towering figures from the G4G community. It is hard for many of us to see how we can go on without them, but their legacy will live on. In this tribute session, we honor Elwyn Berlekamp, John Conway, Richard Guy, Ron Graham, and
From playlist G4G14 Videos
Elwyn Berlekamp - Gallimaufry of Games - G4G13 Apr 2018
Gallimaufry of Games
From playlist G4G13 Videos
Elwyn Berlekamp - Sol Golomb Tribute Video - G4G13 Apr 2018
Sol Golomb Tribute Video
From playlist Tributes & Commemorations
Project IV: Bessel Functions and their Zeros | Lecture 47 | Numerical Methods for Engineers
MATLAB project to compute the zeros of the Bessel functions. Join me on Coursera: https://www.coursera.org/learn/numerical-methods-engineers Lecture notes at http://www.math.ust.hk/~machas/numerical-methods-for-engineers.pdf Subscribe to my channel: http://www.youtube.com/user/jchasnov
From playlist Numerical Methods for Engineers
"Martin Gardner 1914-2010 -- The Best Friend Mathematics Ever Had"
"Martin Gardner 1914 2010 -- The Best Friend Mathematics Ever Had" video presentation by Colm Mulcahy. An introduction to popular mathematics and science writer Martin Gardner, who wrote over 100 books, created for the centennial of his birth. Videotaped by Laura McHugh of the MAA, post pr
From playlist Featuring Martin Gardner
Bézier curves (Coding Challenge 163)
Have you ever wanted to know more about bézier curves in p5.js? Thanks to a generous donation from Jason Oswald, I do a deep dive exploring the bézier curve function and the math behind the algorithm? Code: https://thecodingtrain.com/challenges/163-bezier-curves p5.js Web Editor Sketches:
From playlist Recent uploads