A convex polyhedron Q has vertices V1, V2, ..., Vn, and 100 edges. The poly-
hedron is cut by planes P1, P2, ...., Pn in such a way that plane Pk cuts only
those edges that meet at vertex Vk. In addition, no two planes intersect inside
or on Q. The cuts produce n pyramids and a new polyhedron R. How many
edges does R have?
I'm not fully understanding the problem...
I've been working hard on this question so any help would be appreciated.