fact: Definition ZallLinCombMod (a n m N : Z) (qlist : Zlist) := alllist Z (fun q : Z => ZLinCombMod 1 (ZExp a (m * zmultDrop q qlist) - 1) n N) qlist.
imports: Arith ZArith lemmas natZ dec list exp divides prime modulo gcd modprime order