# computation of the order of $\operatorname{GL}(n,\mathbb{F}_{q})$

Each element $A\in\operatorname{GL}(n,\mathbb{F}_{q})$ is given by a collection  of $n$ $\mathbb{F}_{q}$-linearly independent vectors (http://planetmath.org/LinearIndependence). If one chooses the first column vector  of $A$ from $(\mathbb{F}_{q})^{n}$ there are $q^{n}$ choices, but one can’t choose the zero vector  since this would make the determinant  of $A$ zero. So there are really only $q^{n}-1$ choices. To choose an $i$-th vector from $(\mathbb{F}_{q})^{n}$ which is linearly independent from $i-1$ already chosen linearly independent vectors $\{V_{1},\dots,V_{i-1}\}$ one must choose a vector not in the span of $\{V_{1},\dots,V_{i-1}\}$. There are $q^{i-1}$ vectors in this span, so the number of choices is $q^{n}-q^{i-1}$. Thus the number of linearly independent collections of $n$ vectors in $\mathbb{F}_{q}$ is $(q^{n}-1)(q^{n}-q)\cdots(q^{n}-q^{n-1})$.

Title computation of the order of $\operatorname{GL}(n,\mathbb{F}_{q})$ ComputationOfTheOrderOfoperatornameGLnmathbbFq 2013-03-22 13:06:50 2013-03-22 13:06:50 yark (2760) yark (2760) 15 yark (2760) Proof msc 20G15 OrderOfTheGeneralLinearGroupOverAFiniteField