70 is weird
87,659
Published 2024-04-08
#math #70 #numbers
All Comments (21)
-
I hope you enjoyed the video! Also happy eclipsing! 🌞🌑
-
Its interesting how we subconciously see numbers as "more or less prime" despite not knowing mathematically why
-
12:52 the french pronouncing numbers
-
70 here, and I would like to verify this: I am in fact a bit weird.
-
Weird? They're not even odd!
-
Pausing halfway through the video to say this is the first time I've ever seen an explanation of perfect numbers that feels compelling at all. I never understood in what context their usual definition was supposed to matter at all, and this helps it make a lot more sense!
-
And here i thought 37 was random
-
I should be doing something but instead I'm watching some dude on the internet insult the number 70 in the most overly complicated way imaginable.
-
yeah, i have no clue whats going on
-
6 Mathematicians: Beautiful. Elegant. Perfect. 7 Mathematicians: Disgusting. Horrid. Unusable.
-
the weirdest number for me is 193 but thats only because every single time i bought lunch in college my number to pick up the food at the restaurant it rung up 193
-
And I thought 70 was weird because it was just 60 + 10.
-
These math vids are insane, as a nerd I ask you to continue making these.
-
as an autistic person with a special interest in math i especially like the idea of thinking of numbers as having personalities, so this is a great video for that!! 70 is a Weird Little Child and i love them for it :)
-
Very interesting video! Here are a few of my favorite interesting facts about sums of divisors: 1. Euler found a pretty amazing recursion for σ(n): σ(n)=σ(n-1)+σ(n-2)-σ(n-5)-σ(n-7)+σ(n-12)+σ(n-15)-σ(n-22)-σ(n-26)+..., where the signs are +,+,-,-,+,+,-,-, etc. the numbers 1,2,5,7,... are pentagonal numbers, and we count σ(0) as n if n is a pentagonal number. This comes from his pentagonal number theorem, and a very similar recursion is also valid for the partition function p(n) (the only difference being that p(0) is counted as 1, not n as in the case of σ). 2. The Riemann hypothesis is equivalent to σ(n)
5040, where γ is the Euler-Mascheroni constant. 3. A number satisfying σ(n)=2n+1 is called "quasiperfect", but none are known to exist. It's known that if any do exist, they must be odd squares larger than 10^35. -
Loved this! Got to learn about several new categories/sequences of numbers and your graphics convey so much meaning and understanding. Thanks for making my Monday, hope yours was great and I'm looking forward to the next video as always!
-
Please continue making videos like this. Your views may be low but be sure your videos are very valuable and we know that.
-
Really enjoyed this! The progression of concepts was paced nicely imo.
-
I love this! I've watched a lot of math videos and read many pop math books in my day. Many of them talk about perfect numbers (to the point of nausea) and this felt like a fresh take on the subject.
-
This is one of the most intuitively well explained math videos I’ve seen