I have some difficulty writing the proof for this one.This problem appeared in a shortlist for a mathematical olympiad (for high-school):
Let $A$ be a $n\times n$ matrix with complex entries.
- Prove that there exists a $n\times n$ matrix with complex entries $B$ such that $AB=0$ (the null matrix) and $\operatorname{rank} A + \operatorname{rank}B = n$
- If $1 < \operatorname{rank} A < n$, prove that there exists a $n\times n$ matrix with complex entries $C$ such that $AC=0, CA \neq 0$ and $\operatorname{rank}A + \operatorname{rank} C = n$
Well, since this problem was proposed for the mathematical olympiad, I suppose that the solution involves basic linear algebra concepts i.e. without vector spaces, linear transformations etc.
So far, I have only come up with the fact that if $A$ is invertible, then $B$ is the zero matrix, and using the Sylvester inequality and supposing $A$ singular implies:
$\operatorname{rank} A + \operatorname{rank} B \leq n$
Also, I guess that stating that $\operatorname{rank} B$ exists from the above inequality doesn't imply that exists such $B$ so that $\operatorname{rank} B = n - \operatorname{rank} A$.