马丁·加德纳的最小三排问题
Martin Gardner's minimum no-3-in-a-line problem
摘要：
1976年10月，马丁·加德纳（Martin Gardner）在《科学美国人》（Scientific American）的数学游戏专栏中提出了以下问题：“你可以在n边的棋盘上放置的最小数量的[皇后]是多少，这样就不会在一行、一列或对角线上增加三个[皇后]？我们使用组合零点定理来证明这个数至少是n，除了n与3模4全等的情况，在这种情况下少一个就足够了。第二，更基本的证明也提供了在这种情况下，n是偶数。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
