Name
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 an [n x n chessboard] such that no [queen] can be added without creating three in a row, a column, or, except in the case when n is congruent to 3 modulo 4, in which case one less may suffice." We use the Combinatorial Nullstellensatz to prove that this number is at least n. A second, more elementary proof is also offered in the case that n is even. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.4169/amer.math.monthly.121.03.213 | AMERICAN MATHEMATICAL MONTHLY |
Field | DocType | Volume |
Combinatorics,Algebra,Mathematical analysis,Modulo,Elementary proof,Congruence (geometry),Mathematics,Mathematical game | Journal | 121 |
Issue | ISSN | Citations |
3 | 0002-9890 | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alec S. Cooper | 1 | 0 | 0.34 |
| Oleg Pikhurko | 2 | 318 | 47.03 |
| John R. Schmitt | 3 | 19 | 4.82 |
| Gregory S. Warrington | 4 | 0 | 0.34 |