A convex polyhedronQhas verticesV1,V2, ...,Vn, and 100 edges. The poly-

hedron is cut by planesP1,P2, ....,Pnin such a way that planePkcuts only

those edges that meet at vertexVk. In addition, no two planes intersect inside

or onQ. The cuts producenpyramids and a new polyhedronR. How many

edges doesRhave?

I'm not fully understanding the problem...

I've been working hard on this question so any help would be appreciated.

Thanks.