diplomatic fish
diplomatic fish
  • 4
  • 419 657
How to Calculate 1^3 + 2^3 + ... + 100^3 By Hand #SoMEpi
Join us as we discover how power sums are hidden in Pascal's Triangle, and how this lets us form a generalized process for evaluating even the most impossibly complex power sums.
This was a much less serious undertaking than our previous submissions, especially as we've become more busy with our own personal endeavors. Nonetheless, we had a blast making it and we hope you all enjoy!
The video we made for SoME2: ua-cam.com/video/BfbZPEevM64/v-deo.html
The video we made for SoME3: ua-cam.com/video/50pXtgintLc/v-deo.html
Special thanks to Talia S for the fish!
The video title and description will likely be updated as it is currently 4am and I am not thinking this all the way through.
Переглядів: 6 833

Відео

Solving the Most Ridiculous Systems of Equations (ft. a cool theorem) #some3
Переглядів 98 тис.Рік тому
Join us on an algebraic journey as we solve several crazy systems of equations, building up to formulating and proving the Fundamental Theorem of Symmetric Polynomials. This video was a serious undertaking for us and is quite different from our previous video, so let us know what you think of it! We've got lots more ideas that we hope to post more frequently, but we're still figuring out our st...
What's So Natural About e? #some2
Переглядів 286 тис.2 роки тому
Join us on a journey where we explore a visual approach towards e, uncovering the intuition behind some of its common definitions and features. This Wikipedia page has rigorous proofs of the facts presented in the video: en.wikipedia.org/wiki/Characterizations_of_the_exponential_function Timestamps 00:00 Intro 00:41 Tally's Growth Rule 04:30 Infinite Series Formula 13:04 Limit Formula 17:39 Wha...

КОМЕНТАРІ

  • @qwikscopez6619
    @qwikscopez6619 8 днів тому

    As someone who has a degree in data science, done far too many modules that involve complex multivariable calculus and i have never in my life understood e so much. So many insane integrations and distributions now make sense, why dont they just start with this?

  • @FranzBiscuit
    @FranzBiscuit 9 днів тому

    Well done! The visuals were crisp and the explanation was very clear. *SUBSCRIBED*

  • @skorza1148
    @skorza1148 10 днів тому

    The fact that x⁴ + y⁴ + z⁴ is agonizingly close to 4 but not 4 is killing me

  • @arthurmoreira8096
    @arthurmoreira8096 11 днів тому

    I'm so happy that you're back :)

  • @arthurmoreira8096
    @arthurmoreira8096 11 днів тому

    Thank you for such an amazing video!!

  • @aura_beast2678
    @aura_beast2678 17 днів тому

    I have a better and easiest solution , anyone want?

  • @Why553-k5b_1
    @Why553-k5b_1 18 днів тому

    =(1+2+3+4+5+....+100)² =5050² =(5000+50)² =5000²+2(5000)(50)+50² =(50•100)²+10000(50)+2500 =2500•10000+500000+2500 =25000000+500000+2500 =25002500+500000 =25502500

  • @birdbeakbeardneck3617
    @birdbeakbeardneck3617 19 днів тому

    one week ago watched the 1st 20s of the video so only the first problem and found he answer and didn't check the answer, then went into a rabbit hole exploring symetric ploynomial expressions, what coefficient resulting product of any two basic elementary expressions, and wanted to find out if you always can find solution of sums of powers if you have enough symetrix expressions and if you can determine if you what you have, and got stuck hinking ithas to do with rings complicated combinatorics and partition numbers relted topics. i came back today and had a lot adun watching this, from a different solution to the first problem , to the variabkes being roots of single polynomial, to them being written in terms of elementary forms, similar to bases on vector spaxes, and a reduction strategy similar to the shaun substitution lemma for base conversion in vector spaces. also the quality and pacing and the right amount of examples make this even better. keep up the goodwork. i might try to code the algorithm at the end

  • @NaplesFC
    @NaplesFC 19 днів тому

    Nice vid , understood it completely

  • @pedrobraga6633
    @pedrobraga6633 19 днів тому

    Wym?

  • @darkicegamerz9519
    @darkicegamerz9519 20 днів тому

    Use vieta relation and voilá get the answer

  • @jlp8573
    @jlp8573 20 днів тому

    this is outrageously overcomplicated. Simply note Sn = x^n + y^n +z^n; P1 = x+y+z; P2 = xy + yz + xz; P3 = xyz. We know S1 S2 S3, lets go for S4! We have P1 = S1 = 1; P2 = (1/2)(S1²-S2) = -1/2; P3 = (1/6)(S1^3 + 2S3 - 3S1S2) = 1/6. Then let P(X) = (X-x)(X-y)(X-z) = X^3 - P1X^2 + P2X - P3. We have P(x) = P(y) = P(z)=0. with x : x^3 = P1x^2-P2x+P3. Multiply by x^n : x^(3+n) = P1x^(2+n) - P2x^(1+n) + P3x^n. Sum with y and z same way, you get the recurrence S(n+3) = S(n+2) + (1/2)S(n+1) +(1/6) Sn. Apply n = 1 : S4 = 3+1+1/6 = 25/6

  • @forever_stay6793
    @forever_stay6793 20 днів тому

    Congratulations on getting honorable mention this year! I hope you keep participating in SoME because your videos are great 🫶

  • @zhato3377
    @zhato3377 20 днів тому

    2:13 THIS IS RIDICULOUS.

  • @seanhoward7343
    @seanhoward7343 20 днів тому

    This may not be the point of the video, but I really want to track along with all of the algebra to simplify the initial systems and I am absolutely lost at the 2:30 time-stamp. How does +/- (1-z)*sqrt(-3z^2+2z-3) simplify to 0?!? What am I missing in that step?

    • @seanhoward7343
      @seanhoward7343 20 днів тому

      Ah shoot, nevermind! It clicked, they cancel if you split the fractions up and distribute the coefficients. Back on track!

  • @Anonymous_MC
    @Anonymous_MC 21 день тому

    complex numbers just killed me

  • @XrcyhikUbhdfbjdf
    @XrcyhikUbhdfbjdf 24 дні тому

    Allen Donald Lewis Ruth Smith Michelle

  • @XrcyhikUbhdfbjdf
    @XrcyhikUbhdfbjdf 24 дні тому

    Johnson Angela Lewis Patricia Lewis Mary

  • @SobTim-eu3xu
    @SobTim-eu3xu 26 днів тому

    Oh, I watch you a year ago)

  • @vamer423
    @vamer423 26 днів тому

    The mistake is that 1/2= 0 not pi, lol it's like basic math.

  • @annarbor9400
    @annarbor9400 27 днів тому

    I enjoyed your videos. But, I don't see the benefit I would have by subscribing, with only 1 video published a year.

  • @jakobr_
    @jakobr_ Місяць тому

    Those sound effects are divine

  • @JoaoVictor-xi7nh
    @JoaoVictor-xi7nh Місяць тому

    dude I did not expect to just stumble into some cool math I've never heard of. are there any books recommended for going deeper into this?

    • @diplomaticfish
      @diplomaticfish 18 днів тому

      I found this video interesting: ua-cam.com/video/3imeTgGBaLc/v-deo.html From there, you can read any good book on Galois theory.

  • @imnotkentiy
    @imnotkentiy Місяць тому

    also mildly interesting is that the zeroth diagonal can be used to calculate sum of numbers to zeroth power. don't know why you would want that thou

  • @user-pr6ed3ri2k
    @user-pr6ed3ri2k Місяць тому

    n²(n+1)²/4

  • @scmtuk3662
    @scmtuk3662 Місяць тому

    So, his true love gave him 364 gifts for Christmas?

  • @viktoriously
    @viktoriously Місяць тому

    Hi! Nice video! Refreshing to listen to something original using only elementary math! I have been playing around with symmetrical variables my self. I came up with my own notation called symmetric exponentiation and it’s exactly like the s-terms. So when ever I have indices for variables in any problem where the indices are interchangeable without changing the system (thus the variables are symmetric) I used the notation s_n=x^(n) instead where x is the variable and using () to denote the symmetry just like one does in the Einstein notation sometimes. For instance, the problem of find the inscribed circle has the solution: r^2=x^(3)/x^(1) Have a very neat formula regarding inscribed and subscribed circles for polygons that would be fun to discuss with you!

  • @OutbackCatgirl
    @OutbackCatgirl Місяць тому

    ......... it is, at time of writing, precisely 6 minutes to 3am. maybe i should sleep

  • @MichaelDarrow-tr1mn
    @MichaelDarrow-tr1mn Місяць тому

    Compound interest turns x2 into xe

  • @skpcboy
    @skpcboy Місяць тому

    okay fishboy

  • @Mikalinium
    @Mikalinium Місяць тому

    I love the sounds the numbers make when they are placed! It sounds like a game.

  • @joshuaiosevich3727
    @joshuaiosevich3727 Місяць тому

    Basically, computing the summation of a pascal diagonal type polynomial is really easy. In a linear algebra sense, if you use them as a basis for polynomials, summation amounts to shifting your vector. EG the polynomial 1+n+n(n+1)/2 can be represented as (1,1,1,0,,,0), the summation is just (0,1,1,1,0000)

  • @joshuaiosevich3727
    @joshuaiosevich3727 Місяць тому

    The sum of integer powers can be written down in a closed form, found it in hs. It’s a double sum however. Sum from k=0 to a of (N+1 choose k) sum from j=0 to k of (-1)^(j*k)(k choose j)*k^a. a is the integer power.

  • @masteroftheinternetverse1296
    @masteroftheinternetverse1296 Місяць тому

    Fun little math fact: The sum from 1 to n plus the sum from 1 to n+1 will always give a perfect square.

    • @Summertraveling
      @Summertraveling 18 днів тому

      @@masteroftheinternetverse1296 specifically (n+1)^2

  • @KlavikP
    @KlavikP Місяць тому

    This video is nicely done. I have made a video about this approach last year: ua-cam.com/video/k-9YCo_C4J4/v-deo.html, using the so-called Hockey stick identity in Pascal's triangle. The coefficients how they are combined in general is not super nice. Related to Stirling numbers if someone is interested.

  • @forever_stay6793
    @forever_stay6793 Місяць тому

    6:00 y'all ate fr

  • @forever_stay6793
    @forever_stay6793 Місяць тому

    I always look forward to your SoME videos; can't believe it's already been a year since the last one!

  • @andrewdjang2080
    @andrewdjang2080 Місяць тому

    Absolutely love the video! It's clear that a lot of work went into it, as the animations are crisp and clean, while the presentation is both clear and enjoyable. The approach that you have outlined for finding sums of powers is very cool, especially because it is not one of the most conventional/standard methods. However, a natural question arises: what are the constants c_1, c_2, c_3, ... etc? Sure, they can be computed by brute force, but is there a deeper pattern or significance to them of which you are aware? Also, is there a combinatorial interpretation of this method beyond mere algebraic equivalence? These seem to be missing pieces to an otherwise compelling story. But as a youtube video on this topic, it is definitely miles beyond most of them out there, so I look forward to your next one. Thanks!

  • @ShauyanOfficial13
    @ShauyanOfficial13 Місяць тому

    What is the upper number for the Ck in the general formula?

  • @aze4308
    @aze4308 Місяць тому

    Nice singing!

  • @gametimewitharyan6665
    @gametimewitharyan6665 Місяць тому

    2:17 I never knew an induction proof would be explained so sneakily without making it feel like an induction proof

  • @MarshallBrunerRF
    @MarshallBrunerRF Місяць тому

    That was incredible! The animations were soooo clean and well thought through. Such a great explanation and y’all made the alternating talking parts feel very natural which I’m sure is not easy to do. Hope to see more videos!

  • @filedotnix
    @filedotnix Місяць тому

    it's a small detail, but I appreciate that your rendering of Pascal's triangle uses hexagons. it makes it a lot easier to view diagonal paths than when the square visualization is used.

  • @pedropiata648
    @pedropiata648 Місяць тому

    I couldt understand this metod, but now i can

  • @harelrubin1432
    @harelrubin1432 Місяць тому

    But how can i find a general form for the constants?

    • @ericaperin7243
      @ericaperin7243 Місяць тому

      Bernouli numbers

    • @andrewdjang2080
      @andrewdjang2080 Місяць тому

      @@ericaperin7243 these are not Bernoulli numbers

    • @andrewdjang2080
      @andrewdjang2080 Місяць тому

      If you are curious, you can find them by summing Newton's Forward Difference Formula for n^k, from which it is apparent that c_i is the i-th forward difference of n^k, evaluated at n=0. The constants can therefore be calculated from the explicit formula c_i = Sum[((-1)^(i+j))*Choose(i , j)*(j^k), j ,0, k]. These numbers are closely related to Stirling Numbers of the Second Kind and they have a number of other combinatorial as well as geometric interpretations.

  • @voliol8070
    @voliol8070 Місяць тому

    Great video! Pascal's triangle is my favorite mathematical object, due to all the little secrets it holds, like this one. And the presentation was top-notch. Really like how you took the time to explain the relation between n choose k and the triangle; even if it's apparent the triangle is combinatoric-y (you combine the upper terms to get the lower), the relation between the formula and the triangle is often pulled through thin air. If I may have one criticism though, it is the video felt a little open-ended. Or rather, I was fully expecting there to be a *second* trick coming up, to somehow extract those coefficients directly from the triangle. Like, surely there must be a more elegant way of getting those? And then the video just ended.

    • @nin10dorox
      @nin10dorox Місяць тому

      I can answer about the constants, but I don't know of any nice visual ways to show it. C_n = Δ^n[x^k](0), the nth-order forward difference of x^k, evaluated at 0. This is because the final formula in the video is the Newton series of the power sum.

  • @Summertraveling
    @Summertraveling Місяць тому

    ok fishboy

  • @trwn87
    @trwn87 Місяць тому

    This was one of the first indie math videos I have ever encountered, looking at it again, it's so nicely explained!

  • @mie5953
    @mie5953 Місяць тому

    epic as usual

  • @DeJay7
    @DeJay7 Місяць тому

    I love how on the outro you talk about e being natural and all I could think of is "e is about as natural as you two are in front of the camera" 😂 Sorry, great video. I did spot some problems with it (as someone who entirely understands the topic at hand), it could have been slightly improved, but it was almost perfect at what it wanted to and needed to achieve, so it's great!