NEWS · 2026-10-03

Four proofs settle nine instances

Drawn from the problem discussions and mailbox submissions: each argument was verified step by step with missing details filled in, closing all nine instances as proven optimal while preserving their record histories.

P89 n = 4, 8, 16, 18 and P91 n = 12, 27: full tilings

The total area of the pieces gives a lower bound on the enclosing square’s side length, and these six instances admit gapless tilings that attain the bound exactly. hadsajnc contributed the argument for P91 (+2); NUE_13 noted the same area bound for P89 (matching their earlier awarded argument for P90) and 😰 wrote out the explicit inequality, with both credited.

Read the proof →

P90 n = 1: one domino

Regardless of rotation angle, at least one of the domino’s two axis projections has length at least 2. Contributed by LittleChasa, with the concavity step completed by the site (+2).

Read the proof →

P82 m = 6, n = 3: three circles in a hexagon

A centroid identity shows that three circle centres inside the inset hexagon must have a pair closer than 2r unless r ≤ √3/4. Contributed by NUE_13 (generated with DeepSeek, as disclosed; +2).

Read the proof →

P17 n = 6: six points in a rectangle

Splitting the 2 × 1 rectangle into two horizontal strips forces three points into one strip, and an iterative width bound yields d ≤ 1, attained by the 2 × 3 grid. Emailed by NUE_13 (generated with DeepSeek, as disclosed; +2).

Read the proof →

Awards

Four distinct proof contributions each receive a permanent +2 proof award: two for NUE_13 (P82, P17), one for hadsajnc (P91), and one for LittleChasa (P90). Because each proof method is awarded once per contributor, the repeated area bound on P89 and the restated inequality receive attribution without duplicate points. Verifiers, scoring units, and historical submissions remain unchanged.

All news · Scoring