olligobber boosted
olligobber boosted

Breaking news in the algorithmic/arithmetic world!

Integer multiplication in time O(n · log n). [1]

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 [2] (Schönhage–Strassen), that was in O(n · log n · log log n)

[1] hal.archives-ouvertes.fr/hal-0
[2] en.wikipedia.org/wiki/Sch%C3%B

olligobber boosted

The Incredible Proof Machine: "LabView wrestled through the Curry-Howard isomorphism"

incredible.pm/

olligobber boosted

@olligobber Another proof by induction: If you don't believe this, you're drafted.

olligobber boosted

I have set my phone's device name to "Pology". So now whenever I use my bluetooth headset, I hear "Connected to-Pology".

Huh, the squares of odd affine transformations of the euclidean plane form a group.

olligobber boosted

Dreamed about set theory.

Except with a bunch of 'advisory' axioms.

Like, if you take a set outside and it gets rained on, make sure to dry it thoroughly before defining any sets of which it is a member or they'll both get mildewed.

olligobber boosted
olligobber boosted

Maths Problem + Olympiad Comments Show more

Unicode is so amazing that the python statement len("ㅤ ㅤ ㅤ".split()) prints out your python version, 2 or 3.

olligobber boosted

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!

Mathstodon

A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.

Use \( and \) for inline LaTeX, and \[ and \] for display mode.