Ciro Santilli @cirosantilli 37

XML, ain't nobody ever going to write that manually.

Can be calculated efficiently with the Extended Euclidean algorithm.

The beauty of this algorithm is that because exponentiation grows really fast, there is no hope that we can ever learn all the digits of an exponential, as there is simply not enough time or memory for that. Therefore, a natural sub-question is if we can know some part of that number, and knowing the smallest digits is the most natural version of that question.

Not a fun of giving up control for such a low-maintenance cost venture... but keeping a list just in case...

Published as session reports of the Royal Prussian Academy of Sciences at Berlin.

Qt front-end for FluidSynth.

Minimum number of elements in a generating set of a group.

TODO this would give a better motivation for the Mathieu group

Higher transitivity: mathoverflow.net/questions/5993/highly-transitive-groups-without-assuming-the-classification-of-finite-simple-g

These are not in the Greek alphabet:

Does not require straight line cuts.

A set of theorems that prove under different conditions that the Fourier transform has an inverse for a given space, examples: