The Sophie Germain Prime Project primarily aims to collect, analyse and distribute Sophie Germain primes. Such special prime numbers p have the additional condition that 2p + 1 is also prime (called a safe prime).

Deep dive into the Blum-Blum-Shub pseudorandom number generator.

Can a simple and principled data compressor find its place in the world of emerging, purpose-built code-golf languages?

Musings on triangulation techniques for convex polygons.

An alternative, easy to follow derivation of Shannon entropy.

A brief introduction to my favourite theorems in computability theory.

A collection of curiosities concerning Fibonacci numbers, primes and relations between them.

How to solve a mathematics problem using the supercharged powers of APL?

An easy method to accelerate the computation of infinite sums of rational functions using the digamma function and other numerical methods.

We all know the Newton-Raphson method for approximating the zero of a real-valued function, but how do we approach the problem of finding all real and complex roots of a polynomial?