A Surprising Combinatorics Bijection! @DrWeselcouch
A Surprising Combinatorics Bijection!  @DrWeselcouch
Uploaded February 2021 | Updated September 2026, 7 hours ago
In this video we count the number of partitions with m or fewer parts such that the largest part is at most n. We solve this by finding a bijection with a set of objects that are easy to count.
A Surprising Combinatorics Bijection!Fibonacci Sequence in MinecraftSolutions of Systems of Linear Equationsphi^pi vs pi^phi #ShortsApplications of Functions in Business and EconomicsYour Daily Epsilon of Math 2/9 Solution #shortsGeometry Puzzle from TwitterThe Vector Space of Complex NumbersModular Arithmetic is Over Powered!Your Daily Epsilon of Math 1/18 Solution #shortsCatalan Numbers in MinecraftApplications: Marginals and Derivatives
Dr. Weselcouch |

A Surprising Combinatorics Bijection!

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER