28 views
In each cell of an $n \times n$ chessboard there is a lamp. When a lamp is touched, the state of this lamp and all the lamps in its row and its column is changed. Initially all the lamps are off. Show that it is always possible to turn on all the lamps with finitely many touches, and find in terms of $n$ the minimum number of touches needed.
| 28 views