The statement by G.H. Hardy supporting Norman Levinson is remarkable:
"Tell me, Mr Bush, do you think you're running an engineering school or a theological seminary? Is this the Massachusetts Institute of Theology? If it isn't, why not hire Levinson."

A new kind of wiki, from Ward Cunningham, inventor of WikiWikiWeb.
Found on https://en.wikipedia.org/wiki/Ward_Cunningham and https://en.wikipedia.org/wiki/Federated_Wiki

The statement "I've found that Aberth performs worse [than Weierstrass-Durand-Kerner] on most examples as its faster convergence is offset by the slower evaluation." is interesting.
Fredrik Johansson is the author of https://mpmath.org/, https://arblib.org/ and https://flintlib.org/ arbitrary-precision libraries and of the Mathematical Functions Grimoire https://fungrim.org/
https://flintlib.org/doc/examples_arb.html#pi-c has an example where π is calculated to 10^6 digits.

Technique to extend bandwidth invented at Tektronix, found on https://w140.com/tekwiki/wiki/Bridged_T-coil

Blog of the mathematician Alice Silverman.

Another mathematics blog, found on John D. Cook's blog https://www.johndcook.com/blog/2018/09/24/riemann-hypothesis-the-fine-structure-constant-and-the-todd-function/

Website to search for patterns in the first 2e8 decimal digits of π.

The SLURM Workload Manager is an open source, fault-tolerant and highly scalable cluster management and job scheduling system[1] used on the DEAC cluster. Formerly known as Simple Linux Utility for Resource Management (aka SLURM)[2], it provides three key functions:

Allocates exclusive and/or non-exclusive access to resources (compute nodes) to users for X period of time
Provides a framework for starting, executing, and monitoring work on allocated nodes
Arbitrates contention for resources by managing a queue of pending jobs

See also https://wiki.deac.wfu.edu/user/Software:OpenPFGW a primality test program

Found via a comment on https://github.com/excalidraw/excalidraw

Lecture notes by Dr. Madhu Sudan, found on Wikipedia https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Welch_algorithm