two different sides,
one corner and an opposing side, or
two opposite corners of the square.

Sequential slices may or may not cross previous ones, but a set of slices will subdivide the square into polygonal regions.

Find (or prove impossible) a way to slice a square into 7 pieces of equal area with n distinct slices for each n={3,4,5,6,7}