move multidim-dotimes+ into ol-utils
clean up `nullspace' function and helpers
introduce empty-vectors to avoid empty arrays
implement solving inhomogenous linear systems
expt-mod and variables for shadowing-imports
improve the API for factor lists; fix problems with squarefree factorisation
start annotating babystep-giantstep algorithm
cleanup code for factorising into factors of distinct degree of dividing irreducibles
one method to factor polynomials where all irreducibles have same degree
first part of Berlekamp factorision algorithm
salvage useful functions from old Berlekamp implementation
manage asd
lift a factorisation over a finite field (of prime order) to polynomials
over the integers by looking at possible combinations of factors
use random elements of the Berlekamp space which are likely to share only some
factors with the original polynomial
move some context-developed functions into the proper place
another variant of the Berlekamp algorithm

* this one is following the observations from Knuth
add a nice tweak -- r-1 are enough
fix wrong use of div function, have ggt produce monic polynomials when
working over finite fields
fix various small runtime errors
change wrong use of term `rank' into proper use `dimension'