Ever wondered why some infinite sums add up nicely while others don't?
Ever wondered why some infinite sums add up nicely while others don't?
Imagine you're trying to add up an infinite list of numbers, starting with 1, divided by 2 squared, 3 cubed, and so on. You want to know if this endless list will add up to a finite number.
Think about adding up the amount of paint needed for each layer of a painting. If each layer uses less paint than the last, eventually you'll have just enough paint for all layers combined. This is like a series where each term gets smaller and smaller, and there's a limit to how much paint you need.
Example
If you have 1/2 for the first layer, 1/8 for the second, 1/27 for the third, and so on, you're adding up fractions that get smaller and smaller.
Remember this
The series Σ(1/n^p) for p > 1 converges because the terms get small enough fast enough that their total sum doesn't go off to infinity.
Text adapted from Wikipedia, licensed under CC BY-SA 4.0.
Gibbs phenomenon
Why does a Fourier series overshoot at sharp edges?
Glossary of engineering: M–Z
Can calculus functions flip between smooth and abrupt?
Constructive set theory
Why can't you always find the smallest number in a list?
Fourier series
Did you know a smooth curve can be broken down into simpler waves?
Sturm's theorem
Can you always split a polynomial into simpler pieces to find its roots?
Golden ratio
Did you know math shapes our world?
Swipe through 100 ML concepts daily
Open Pocket Polymath