Solution 59: Recursion and Hidden Fibonacci Sequence
3,081 views · Published 27 September 2018 · 12:33 · Indexed 6 November 2026
Channel: LetsSolveMathProblems · 2018 · Education
We use creative counting methods--recursion and one-to-one correspondence--to count the number of 9-digit (and 2001-digit) integers that satisfy the constraints. Congratulations to Walker Powell, attyfarbuckle, Kevin Tong, GreenMeansGO, CymoTec, Seth Harwood, Nicola C, Sean Skelly, SeongKyun Jung, and Bigg Barbarian for successfully solving this math challenge question! Walker Powell was the first person to solve the question. Your support is truly a huge encouragement. Please take a second to subscribe in order to send us your valuable support and receive notifications for new videos! Every subscriber and every like are wholeheartedly appreciated.
