I believe it is a basic problem, but I would like some help proving this statement:
Prove that a $n\times m$ checkerboard can be filled with $k\times 1$ tiles if and only if k divides m or n.
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
No comments:
Post a Comment