Covering a square by small perimeter rectangles

We show that if the unit square is covered byn rectangles, then at least one must have perimeter at least 4(2m+1)/(n+m(m+1)), wherem is the largest integer whose square is at mostn. This result is exact forn of the formm(m+1) (orm2).