Problem 28 (difficulty: 7/10)

We cut two diagonally opposite corner squares of a chessboard. Can we cover the left with \(\displaystyle 1\times 2\) dominoes? And for the \(\displaystyle n\times k\) chessboard?

Give me another random problem!

Subject, section:
Requested difficulty:
Request for a concrete problem:I want problem no.

Supported by the Higher Education Restructuring Fund allocated to ELTE by the Hungarian Government