The Student Room Group
Take such a matrix M; if you can show that det(M - I) = 0, you're done (why?). In order to do that, notice that each column vector of (M-I) is an n-dimensional vector with entries adding to 0; but then notice that these must be linearly independent (e.g. show that the vector space V of n-dimensional column vectors with entries adding to 0 is (n-1)-dimensional).
Reply 2
More rapidly, you can show that the row vector (11)\begin{pmatrix} 1 & \ldots & 1 \end{pmatrix} is a row-eigenvector, with eigenvalue 1. But then any eigenvalue corresponding to a row-eigenvector is an eigenvalue corresponding to a column-eigenvector (since detAT=detA\det A^T = \det A).
Aye, also fine. I don't think it's much easier than my method, because it requires you to spot that trick, but if you spot it, that's fine too.

Latest