Thursday, 2 May 2019

discrete mathematics - Proof for a ntimesm checkerboard tiling

I believe it is a basic problem, but I would like some help proving this statement:



Prove that a n×m checkerboard can be filled with k×1 tiles if and only if k divides m or n.

-

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...