Mersenne Primes & Perfect Numbers @DrBarker
Mersenne Primes & Perfect Numbers  @DrBarker
Uploaded July 2026 | Updated November 2026, 2 hours ago
We explore conditions for when 2^n - 1 can be a prime number, then conclude with a fun connection between Mersenne primes and perfect numbers.

Sum of divisors formula: youtu.be/aQopgdf-0YU

00:00 When is 2^n - 1 prime?
02:05 Proof
05:28 Bonus result
07:05 Connection to perfect numbers
10:20 Proof
Mersenne Primes & Perfect NumbersA 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 Sequence
Dr Barker |

Mersenne Primes & Perfect Numbers

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER