`det'
-----

det(MAT[,MOD])
     :: Determinant of MAT.

RETURN
     expression

MAT
     matrix

MOD
     prime

   * Determinant of matrix MAT.

   * The computation is done over GF(MOD) if MOD is specitied.

   * The fraction free Gaussian algorithm is employed.  For matrices
     with multi-variate polynomial entries, minor expansion algorithm
     sometimes is more efficient than the fraction free Gaussian
     algorithm.

     [91] A=newmat(5,5)$
     [92] V=[x,y,z,u,v];
     [x,y,z,u,v]
     [93] for(I=0;I<5;I++)for(J=0,B=A[I],W=V[I];J<5;J++)B[J]=W^J;
     [94] A;
     [ 1 x x^2 x^3 x^4 ]
     [ 1 y y^2 y^3 y^4 ]
     [ 1 z z^2 z^3 z^4 ]
     [ 1 u u^2 u^3 u^4 ]
     [ 1 v v^2 v^3 v^4 ]
     [95] fctr(det(A));
     [[1,1],[u-v,1],[-z+v,1],[-z+u,1],[-y+u,1],[y-v,1],[-y+z,1],[-x+u,1],[-x+z,1],
     [-x+v,1],[-x+y,1]]

References
     *Note `newmat': newmat.

