In one of my problems that I posted recently, Sir Brian Charlesworth posed a question asking what was the maximum possible coverage by n rectangles.
I honestly have no idea how to do this, so I figured I'd ask you guys, the Brilliant community, to see what you guys could think of.
I don't even know if this is answerable, but we'll see.
My plan is:
Find the positioning of n-squares that will allow for maximal coverage
Find the maximum coverage possible by n squares.
Find what shape n-rectangles will take.
Find the maximal coverage of n-rectangles.
Feel free to skip to any step.