Breaking news in the algorithmic/arithmetic world!
Integer multiplication in time O(n · log n). 
It means you can multiply two n-bits integer using roughly n log n operations. It's a *very* important problem because a lot of mathematical software rely on efficient integer multiplication.
It breaks the last best known algorithm  (Schönhage–Strassen), that was in O(n · log n · log log n)
I have this stuck in my head: https://www.youtube.com/watch?v=M699TqhO06k
Ooh, a cool puzzle game by @firstname.lastname@example.org https://games.increpare.com/Gestalt_OS/
The Incredible Proof Machine: "LabView wrestled through the Curry-Howard isomorphism"
@olligobber Another proof by induction: If you don't believe this, you're drafted.
Proof by induction: https://www.smbc-comics.com/comic/proof
Maths Problem + Olympiad Comments Show more
Another #problem! This is question 11 from #AIME I 2008. I'm british, but I've been doing these problems as practice for the British #maths #competitions including the #math #olympiad. Last year I got to round two of the #BrMO, can't wait for this year's competition! Any one else interested in Olympiad math?
Give it a go!
Hint: recurrence relations
@enumerator 4, 5 and 6
What a treat! Over the weekend I received an unexpected email from a fan, containing proofs of the Riemann hypothesis, Fermat's last theorem, the Beal conjecture *and* the abc conjecture! Furthermore, they're all proved by the one proof! #blessed
Thanks @christianp for sorting out my signup issues.
Mathematician and design enthusiast. Computing, music, science, video games and art.
A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.
\) for inline LaTeX, and
\] for display mode.