T-062: $s(60)=8$$s(60)=8$, by a mixed cover of points and grid-line segments

The case

Results on the case

9 results in the register on $n=60$$n=60$, oldest first, each with what it established and how it stands now.

1. 2005 published T-007

   s(n)≥min(⌈n​⌉,n−2⌊n​⌋+1​+1)$s(n)\ge min(\lceil \sqrt{n}\rceil ,\sqrt{n-2\lfloor \sqrt{n}\rfloor +1}+1)$ for $4\le n\le 324$$4\le n\le 324$

   S3 V0 C1 lower bound incomplete on this case, superseded by T-062

   Nagamochi · Nagamochi 2005 · source · register

2. 2026-09-04 published T-085

   Nagamochi 2005, Lemma 1 is false for every container with $a>3$$a>3$ and $b>2$$b>2$

   S3 V3 C3 correction confirmed

   Karakuş; chelokot · Karakuş 2026 · chelokot Nagamochi counterexample 2026 · packet · register

3. 2026-09-27 published T-046

   Rectangle-density lower bounds reported for 48 counts in $n=18\dots 95$$n=18\dots 95$

   S3 V0 C0 lower bound recorded superseded by T-062

   wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026 · wand125 rectangle bounds 2026-09-28 · packet · packet · register

4. 2026-09-28 published T-062 this result

   $s(60)=8$$s(60)=8$, by a mixed cover of points and grid-line segments

   S3 V3 C3 optimality confirmed

   Daniel after Burns, Massaccesi · evand square-packing 2026-10-01 · packet · source · review · register

5. 2026-09-28 published T-070

   Rectangle-density lower bounds replayed at 25 counts in $n=29\dots 95$$n=29\dots 95$

   S3 V3 C3 lower bound confirmed superseded by T-062

   wand125 after Tokoharu, Levy, Stromquist, Nagamochi, Burns, Massaccesi · wand125 rectangle bounds 2026-09-28 · packet · packet · source · review · register

6. 2026-09-29 published T-058

   Rectangle-certificate ceiling α·UB(n) proved for $n=1$$n=1$..100; B·UB(n) on 64 grid rows

   S2 V3 C3 method limit confirmed

   wand125 after Tokoharu, Daniel · wand125 tools 2026 · packet · register

7. 2026-09-29 published T-083

   s(n)≥1/2+n−⌊n​⌋+1/4​$s(n)\ge 1/2+\sqrt{n-\lfloor \sqrt{n}\rfloor +1/4}$ for every nonsquare $8\le n\le 324$$8\le n\le 324$

   S3 V3 C3 lower bound confirmed on this case, superseded by T-062

   Karakuş · Karakuş 2026 · source · register

8. 2026-10-03 published T-081

   s(k2−4)=k$s(k^2-4)=k$ for every integer $k$$k$ from 5 up; $k=5\dots 18$$k=5\dots 18$ are the cases held here

   S4 V0 C1 optimality reviewed on this case, second certificate, reported

   Daniel after Burns, Massaccesi · evand square-packing 2026-10-03 · packet · packet · source · review · register

9. 2026-10-07 published T-124

   Reported non-strict local minima for 178 source configurations

   S2 V0 C0 restricted optimality recorded

   Daniel after Couzo · Daniel exact and local reports 2026 · packet · register