Shockingly Easy Hard Problem @DrWeselcouch
Shockingly Easy Hard Problem  @DrWeselcouch
Uploaded February 2021 | Updated September 2026, 1 day ago
Let p(x) be a polynomial and let p_n(x) be the composition of p with itself n times. We show that the polynomial p(x)-x always divides the polynomial p_2021(x)-2p_2020(x)+p_2019(x).

Let me know if you think the video quality is good enough. I'll keep looking for solutions. If you have a webcam that you know works, please let me know!
Shockingly Easy Hard ProblemEulerian Circuit Algorithms (Fleury and Hierholzer)Lets Prove a Catalans Constant IdentityColoring BoundsIrrational^Irrational = Rational? #ShortsMedians, lets find it using Calculus!The 9 Challenge! #ShortsThe Physics of Slow Falling in MinecraftThe extra r in polar coordinatesFunctionsApproximating φ in MinecraftThis Question is Golden! (Hard Optimization Problem)
Dr. Weselcouch |

Shockingly Easy Hard Problem

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER