Youtor
This is how
YOUR LINK HERE:
http://youtube.com/watch?v=V6SR2eQ9KLk
In 2019, I made a tic-toc video proving the following theorem: there are F(n+3) possible operations of length n with operators div, grad or curl which make sense, where F(k) is the kth' Fibonacci number. For example, there are F(5)=5 combinations with two words div grad, curl grad, curl curl, div curl or grad div. There are then F(6) = 8 combinations with 3 operations like div curl grad. ( reccycled the problem this year in the final exam of math s 21a. The proof uses some graph theory. The video from 2019 is reposted here as a youtube short. (On tictoc, I never became a hit. I should have danced to it ....). • https://people.math.harvard.edu/~knil... course page • https://people.math.harvard.edu/~knil... Exam page • https://www.tiktok.com/@oliverknill8/... tictoc page from 2019
#############################
