Martin Gardner's minimum no-3-in-a-line problem
classification
🧮 math.CO
keywords
casecolumngardnermartinnumberproblemaddedamerican
pith:CFCEPLA6 Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{CFCEPLA6}
Prints a linked pith:CFCEPLA6 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
In Martin Gardner's October, 1976 Mathematical Games column in Scientific American, he posed the following problem: "What is the smallest number of [queens] you can put on a board of side n such that no [queen] can be added without creating three in a row, a column, or a diagonal?" We use the Combinatorial Nullstellensatz to prove that this number is at least n, except in the case when n is congruent to 3 modulo 4, in which case one less may suffice. A second, more elementary proof is also offered in the case that n is even.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.