The sizes of the pieces of paper are all the same and fixed. Most likely you'll get the max number of pieces by cutting out pieces with their edges parallel: top of one parallel to and immediately below (no offset to the left or right) the previous piece.
We know that the total area of the "mother" piece of paper is 1000 sq in and that the formula for area here would be A = x y, where x is the width of the "mother" piece and y is the height of the "mother piece."
Let's first look at the height, y, of the "mother" piece. Assume that we're cutting 8.5 by 11 pieces with their 11" sides extending vertically, and their 8.5" sides horiz.
We want to maximize the area taken up by the pieces cut from the "mother" piece. This area is x * y = x * (x/8.5) times (y/11). We use the fact that xy=1000 and solve it for y: y = 1000/x.
Then x*(x/8.5)(1000/x) is to be maximized.
x^2 1000 ----- * --------- is to be maximized. Unfortunately: That comes to 1000x/8.5, which is not very helpful.
Let's try a different approach. Let y be the height of the "mother" piece and x the width. Then, as before, xy = 1000.
Let n be the number of pieces of paper 8.5 by 11. Then y=11n and x=8.5n.
Let's let x=1000/y. Then y=11n and x = 1000/y, or 1000/[11n]). We want to maximize n, the number of pieces of paper. Let's see if this "works:"
Maximize A = xy = (11n) * 1000/
Sorry. I'm not able to move further forward at the moment. Hope this discussion is of some use to you.
