marcus said:
Gokul, as OSU graduate student you probably know some topology puzzles
I didn't know there's a connection betewen Ohio State and Topology. College Football , yes ! Topology...I really wouldn't know...I'm just a poor grad student in the Physics Dept.
how about a real easy one for us?
(I hate hard problems)
Like...with 2 cuts one makes at most 4 pieces (of a convex piece of paper)
with 3 cuts one makes at most 7 pieces
what about with N cuts
how many pieces can one make?
You wanted a good problem...isn't that one such. Or are you asking me to solve it ?
In India you probably do problems like that in Middle School, so come on.
High school, perhaps...not middle school.
Anyways...here's my best shot at N straight line cuts on a convex piece of paper :
I used the Euler relation for a closed sheet, F+V-E = 1 or F = 1+E-V (Faces, Vertices, Edges)
It's not hard to see that V(n) = 2n + n(n-1)/2 = n(n+3)/2
Also, E(n) = 2n + n^2 = n(n+2)
So, F(n) = 1 + n(n+2) - n(n+3)/2 = (2 + n + n^2)/2
Thus, F(1) = 2, F(2) = 4, F(3) = 7, F(4) = 11, etc...
Of course, this is the maximum number of pieces that can be cut. The minimum is just n+1.
EDIT : This approach doesn't allow for nifty rearrangements between cuts !
Namastay, Imp !
