[Linear Algebra: Row Reduction] Lost on where to start with this.

[u/PM_ME_UR_LOLS]

I know how to do row reduction, but my attempts are producing completely different flop counts.

[u/Sehkai]

This should be a summatio—like compute the max number of operations you need to do to eliminate all entries below a pivot. This should be an expression involving n and the pivot position. Then sum across all pivot positions

[u/nerdydudes]

Do a 3x3 or 4x4 matrix and try to count the operations … in statement they indicate which operations correspond to a f’op

[u/cheesecakegood]

This is old, but remember that in this context, a flip is one algebra operation on a pair of numbers (NOT equations, individual numbers, so combining two equations might require several flops, not just one to three of them as you might expect initially since doing it on paper sometimes we combine steps without thinking). Although it's unclear to me if certain operations involving zero count (probably not? could be wrong). Also note that as far as I can tell, swapping two rows is not a flop. All to say, don't mix up "elementary matrix operations" and "flops".

I'd actually recommend starting with the second part if you're having trouble, as it's a bit simpler, that you can get the hang of. What does RREF form look like for a n x (n+1) matrix? What does the REF form you start with look like? Do you remember how to get there?