Let $n,k \geq 2$ be two integers. Prove that there must exist some $n \times n$ invertible, non-diagonal matrices: $X_1,X_2, \dots , X_k$ with real entries, such that $$X_1^{-1}+X_2^{-1}+\dots+X_k^{-1}=(X_1+X_2+\dots+X_k)^{-1}$$
Since this is a problem which asks to construct the matrices, I tried to make it less general. I tried to find some matrices with $X_i^2=I_n$ and hence $X_i^{-1}=X_i$, so what would be left to take care of is the equality $(X_1+X_2+\dots+X_k)^2=I_n.$
For the case when $k$ is odd, I chose $X_1$ to be the matrix with $1$ on the antidiagonal and $0$ anywhere else; then for $X_i=(-1)^iX_1,\: i \geq 2$ the problem is solved.
However, I have problems when $k$ is even. I couldn't find such matrices even when $k=2$.
For $k=2$ we could take
$$ X_1=\begin{pmatrix} 0 & 1\cr 1 & 0 \end{pmatrix},\; X_2=\begin{pmatrix} \alpha & -\beta -1\cr \beta & -\alpha \end{pmatrix}.\; $$ Then we have $$X_1^{-1}+X_2^{-1}=(X_1+X_2)^{-1}$$ and $X_1^2=X_2^2=I$ if and only if $$ \alpha^2=\beta^2+\beta+1. $$ A special case is $\beta=1$, with $\alpha^2=3$.