Row Reduction & Rank · Superchallenge problem

For integers $x$ and $y$, Gaussian elimination without row exchanges is applied to

Find the smallest possible value of $x + y$ for which all three pivots are positive.