A Short Combinatorics Problem @DrBarker
A Short Combinatorics Problem  @DrBarker
Uploaded November 2024 | Updated November 2026, 2 hours ago
Given 10 distinct integers from 1-50 inclusive, we prove that there are always (at least) 3 distinct subsets of the 10 integers which have the same sum.

00:00 Introducing the problem
01:10 Solution
A Short Combinatorics ProblemWhat about this Definition?A Neat Simplification using Complex NumbersCan n^6 + 6n be square?A Fibonacci Series ProblemHow Do They Come Up With This Stuff?How Many Real Solutions Problem (Plus a Proof of Descartes Rule of Signs)Solving a Compound InequalityModulus Function Integration ProblemThere Are More Solutions Than You Might Think | The Pointwise Trap for Functional EquationsA Hyperbolic Take on the Fibonacci SequenceA Neat Application of Complex Numbers
Dr Barker |

A Short Combinatorics Problem

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER