23 Oct
2018
23 Oct
'18
11:14 a.m.
That’s very pretty! What are the best known bounds? Is there a heuristic reason to expect n^(1/3) behavior? Jim Propp On Tuesday, October 23, 2018, Ed Pegg Jr <ed@mathpuzzle.com> wrote:
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-squares with corrected data.
--Ed Pegg Jr _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun