Abstract
If \(n\ne 3k+2\) then \(2n-1\) not divides by 3 and covering is impossible. For \(n=3k+2\) covering is possible if and only if the figure can be divided into \(2\times 2\) square which contains the erased cell and several \(2\times 3\) rectangles.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Brayman, V., Kukush, A. (2017). 2004. In: Undergraduate Mathematics Competitions (1995–2016). Problem Books in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-58673-1_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-58673-1_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58672-4
Online ISBN: 978-3-319-58673-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)