Ciro Santilli @cirosantilli 40

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

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

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

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.

Qt front-end for FluidSynth.

Not done yet as of 2020! Will be done one day for sure.