[xoartqzd] Large primes with generator 2

We use isprimroot_approx to find primes less than certain powers of 2 which have 2 as a primitive root.  Note that

[jtzjuqjl] Some primes less than 2^2048 with smooth p-1

1 + 2^2, 3 bits, least primitive root 2, searched for primes of the form 1 + 2^a (Fermat) with znprimroot=2 1 + 2^16,

[mxhniflk] Test a computer by computing modular exponentiation

Consider testing a computer's CPU by running a long computation and verifying that the result is correct.  We rest

[htahdnnu] Fun with long multiplication

Create multiplication problems whose answers are aesthetically pretty, and encourage doing them by hand.  Some exa

[revllllw] Random number generator with arbitrarily large state

Given a hash function, hash the input strings "0", "1", "2",... that is, the natural numbers written out in some base,