An amazing thing about 276 - Numberphile

This video continues at https://youtu.be/Yh1QUYn2f3I and delves into so-called Untouchable Numbers. More Ben Sparks on Numberphile: bit.ly/Sparks_Playlist

The Numberphile Conjecture: If you give numberphile enough time, every integer will have a video about it.

The fact that he doesn't know the number that's on his wife's half of the heart is concerningly humorous

296 🤦‍♀ (my wife is now not speaking to me for 284 days apparently)

brady commentating the 138 graph has me hysterical oh my lord

8:58 "It's so over!" 9:01 "We're so back!" 9:04 "It's so over!" 9:12 "We're so back!"

That amicable number heart keychain is one of the nerdiest romantic thing I've ever heard of - it's very cute

This is why I love mathmatics: a relatively simple question leads to a whole mini world of calculations and mysteries.

This is really what numberphile is all about

The best part of the video is where he watches the Price of Bitcoin

He's gonna have to sleep on the couch tonight because he forgot his wife's amicable number... AGAIN!

Brady's commentary of the highs and lows of 138 was awesome

Just want to point out that the first number that does a really wild ride was 138, and the next number he showed was 276, which is exactly double. And then the next Lehmer five is 552, again exactly double.

This feels like the 3n+1 conjecture, but finding an actual number that blows to infinity!

I like to imagine that 276 goes all the way up straight to the first and only odd perfect number, and that number also happens to be the first number to start a loop that disproves the collatz conjecture.

11:16 "The answer is... We don't know" Brady, utterly disappointed: "Of course not..."

8:46 What an absolute roller coaster ride of emotions!

For the rest of his days, Ben is going to wake in a cold sweat remembering the time he got 296 wrong. If his friend group is anything like mine, they'd never miss an opportunity to bring it up.

The first time I programmed this was in the 80s on a C64. I hit brick walls several times; first my algorithm to compute the proper divisor sum was too simple and thus too slow for the gigantic numbers I ran into for the 138. When I fixed that, they still kept growing beyond the numbers the programming language could handle. I had to restart the whole programming several times until I found what I really was looking for: These things which I now just learned are called sociable loops. I called them circles. Later I found them again in the OEISⓇ. Very nice to see all my steps again in this video now. ☺

220 and 296. The Parker Heart.