Hearted Youtube comments on Mathologer (@Mathologer) channel.
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
12
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
Professor Polster,
The Mathologer is THE best thing that happens to me in all of the media including Internet, blogs, youtube, social media, podcasts, TV, radio, movies, lectures, courses, and print. I can not describe how much pleasure I derive from watching Mathologer. At times, it's like a detective solving a crime (the crime being the difficult math problem at hand). Thank YOU, MARTY ROSS and OTHER GOOD PEOPLE who make Mathologer, such a good unusual program, possible. May you continue to produce your programs for at least another 50 years.
Behnam Ashjari, PhD EE
11
-
11
-
11
-
11
-
11
-
13:00 Spoilers below!
Using a=1, b=c=d=...=2, the highlighted sequence is
1, 2+2, 3+2+4, 4+2+4+6, ...
In each term of the sequence, we can split up the first term of the sum into k 1s and spread them out over the rest of the terms of the sum, giving
1, 1+(1+2), 1+(1+2)+(1+4), 1+(1+2)+(1+4)+(1+6), ...
Each term of the sequence is the sum of the first k odd numbers, which are the squares.
That means that the sequence generated by the squares is
1, 2*1^2, 3*2^2*1^2, 4*3^2*2^2*1^2, ...
In general, the kth term is k(k-1)!^2=k!(k-1)!
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11
-
11