Translator Disclaimer
2010 Nontrivial solutions to a checkerboard problem
Meaghan Heires, Ryan Jones, Futaba Okamoto, Willem Renzema, Matthew Roberts
Involve 3(1): 109-127 (2010). DOI: 10.2140/involve.2010.3.109

Abstract

The squares of an m×n checkerboard are alternately colored black and red. It has been shown that for every pair m,n of positive integers, it is possible to place coins on some of the squares of the checkerboard (at most one coin per square) in such a way that for every two squares of the same color the numbers of coins on neighboring squares are of the same parity, while for every two squares of different colors the numbers of coins on neighboring squares are of opposite parity. All solutions to this problem have been what is referred to as trivial solutions, namely, for either black or red, no coins are placed on any square of that color. A nontrivial solution then requires at least one coin to be placed on a square of each color. For some pairs m,n of positive integers, however, nontrivial solutions do not exist. All pairs m,n of positive integers are determined for which there is a nontrivial solution.

Citation

Download Citation

Meaghan Heires. Ryan Jones. Futaba Okamoto. Willem Renzema. Matthew Roberts. "Nontrivial solutions to a checkerboard problem." Involve 3 (1) 109 - 127, 2010. https://doi.org/10.2140/involve.2010.3.109

Information

Received: 13 September 2009; Revised: 23 December 2009; Accepted: 29 December 2009; Published: 2010
First available in Project Euclid: 20 December 2017

zbMATH: 1221.05142
MathSciNet: MR2672504
Digital Object Identifier: 10.2140/involve.2010.3.109

Subjects:
Primary: 05C15

Rights: Copyright © 2010 Mathematical Sciences Publishers

JOURNAL ARTICLE
19 PAGES


SHARE
Vol.3 • No. 1 • 2010
MSP
Back to Top