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)
We saw the cutest thing today when we were in the metro.
We walked past a #blind woman who was feeling her way around with her walking stick. As we were waiting by the turnstiles for our bus, we see another blind man waiting at the turnstiles. When he hears a walking stick swinging around, he taps his on the ground three times. The woman tapped hers three times in response and then both their faces lit up.
They ran to each other, embraced, felt their faces, and kissed.
J'ai toujours bien aimé Tchebychev pour ces travaux mathématiques bien sûr mais surtout par ce qu'il nous a laissé une grande liberté pour orthographier son nom 😂
These nice folks have engaged with me, most likely on a maths topic. Simply starting to follow me, or reacting on followfriday posts counts just as well.
Y'all are so cool! Thank you!
Discovery of the day:
A Brazilian number \(n\) is an integer whose base–\(b\) representation has all the same digits for some \(1< b < n−1\).
Extracted from .
 Brazilian Primes Which Are Also Sophie Germain Primes, https://arxiv.org/pdf/1903.04577.pdf
This particular thread on /r/math blew up: a Deputy is asking a question on behalf of an inmate who did a little personal investigation into some number theory
People really like the idea of the Deputy encouraging the inmate to dig deeper into the #maths, and keeping him mentally stimulated + educated while in prison
I wanted to wait for the entire show to be out to watch it, but I was hyped after watching a scene on youtube...
#MobPsycho100 season II, here I go!
Timothy Browning has discovered that
This settles all but one case of which two-digit numbers can be represented as a sum of three cubes. The remaining case is \(n=42\).
For more, see https://gilkalai.wordpress.com/2019/03/09/8866128975287528%C2%B3-8778405442862239%C2%B3-2736111468807040%C2%B3/ (where I found out about this) or https://en.wikipedia.org/wiki/Sums_of_three_cubes (new article I wrote once I found out).
With the introduction of polls on some Mastodon instances, I decided to start the 1st Inofficial Programming Language World Championships! #plwc2019
It's a knockout tournament where 32 programming languages compete against each other, and you decide the winner of each round by voting.
Sadly only a select few instances support polls so far and you won't see them on Fedilab just yet. Check the website!
PHP v Bash
Object Pascal v D
Spread the toot, let's make this a fun one!
PhD student in maths/computer science, curious in anything :).
Toots in English and occasionally en français.
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.