Timeline for Decomposing square of side length $n$ into $n$ squares in a certain "maximal" way
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 24, 2021 at 1:00 | comment | added | fedja | Yeah, that much is obvious, but what is that $o(1)$? Can you figure out at least the second term in the asymptotic (assuming that $n=N^2+\gamma N$, say where $\gamma\in(0,2)$ is a known constant)? The exact solution is, probably, out of reach, of course. | |
| Feb 21, 2021 at 1:15 | vote | accept | Marcel K. Goh | ||
| Feb 21, 2021 at 1:14 | history | answered | Dustin G. Mixon | CC BY-SA 4.0 |