A Neat and Tidy Recursion Problem! @DrWeselcouch
A Neat and Tidy Recursion Problem!  @DrWeselcouch
Uploaded June 2021 | Updated September 2026, 7 hours ago
See the pinned comment that addresses an error I made!

In this video we answer the following question: let f(1) = 2021 and for n greater than 1, sum from i=1 to n of f(i) = n^2f(n). Find f(2021).
This question might sound hard at first , but it simplifies into a simple problem.

Subscribe!
youtube.com/c/DrWeselcouch
A Neat and Tidy Recursion Problem!The FRACTAL contest! #ShortsHow to Use the Limit Definition of Derivative - Great Practice Problems!Polar Coordinates in JulyStable MarriageAn Exponential Equation to get the Blood Flowing!Bertrands Postulate Saves the Day!Higher Order DerivativesDerivative RulesThis Combinatorics Problems will get you thinking!Calculus Optimization but Its Actually GeometryThe Matrix of a Linear Transformation.
Dr. Weselcouch |

A Neat and Tidy Recursion Problem!

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER