I looked through this site and the internet for a while and found some related problems, but not with my particular constraints. The problem is:
Given a $n*m$ rectangle, cut four congruent right triangles using the corners as the right angles. What is the maximum area that each triangle can have?
Let me explain a bit further:
This is an example illustration to help with the visual side of things
You can see that the four lines have created four (theoretically) identical right triangles each with the same area. What I am wondering is how we could maximize this area, while still having each triangle be congruent.
My attempts:
I thought that if we placed the triangles' vertices halfway across each side, such that the $4$ hypotenuses created a rectangle with the empty space. It would look like this:
This would mean that each triangle has area $\frac{1}{8}nm$
For some reason, half of me feels as if this is the solution while the other half feels as if there is something I am overlooking. If anyone could provide some aid as to the correctness of my solution. Many thanks.