Here is the question and it is solution:
Consider the subset $S \subset \mathbb C^3$ consisting of vectors whose only entries are either $0$ or $1.$ How many different bases for $\mathbb C^3$ can we form out of this subset?
$\textbf{Solution.}$
Since the entries of the vectors of $S \subset \mathbb C^3$ are either $0$ or $1,$ then $|F| = 2.$ Since $V = \mathbb C^3$ is of dimension $3,$ So each vector in $v(3,2)$ can be described as a $3$-tuple $(v_1, v_2, v_3)$ where each component $v_j$ is either $0$ or $2,$ so the maximum number of vectors in this vector space are $2^3.$\
Since a basis for $V$ is a linearly independent set, so it can not contain the zero vector, i.e., the first element of the basis can be chosen by $2^3 - 1$ ways. Now, for the second element in this same basis, we should exclude all linear combinations of the first element to pertain linear independence. i.e., the second element can be chosen by $(2^3 - 2)$ ways. For the third element of the same basis ( this is why I multiply the numbers together) we should exclude all linear combinations of the first and the second i.e., $(2^3 - 2^0)(2^3 - 2)(2^3 - 2^2)$ is the number of ordered basis. And the number of unordered basis is $28$ (by dividing by 3!).
I was told that the number I got close to the correct one but not the correct one. Can someone check my solution and correct it please?
Thanks!