23 Oct
2018
23 Oct
'18
9:06 a.m.
Oblong conjecture: any n × (n+1) oblong can be divided into round(n^(1/3)) + 7 or fewer squares. Most oblongs seem to require exactly round(n^(1/3)) + 6 squares. True until at least 388. I've updated https://math.stackexchange.com/questions/2057290/oblongs-into-minimal-square... with corrected data. --Ed Pegg Jr