Originally posted by WanderingKingEach new chord can either not cross any other in which case only one new piece is added.
If you put n distinct points on a circle, and draw chords through them, how many pieces is the circle dissected into? We assume no three chords intersect at one point.
OR
The new chord can cross all existing chords in which case "n" new pieces are added.
Therefore n chords will create P pieces where n < P-1 < n(n+1)/2
Originally posted by wolfgang59While that is true for each chord, I think Wanderingking wants all chords drawable from a given point. So say there are n points, if you add another point you have to add n chords.
Each new chord can either not cross any other in which case only one new piece is added.
OR
The new chord can cross all existing chords in which case "n" new pieces are added.
Therefore n chords will create P pieces where n < P-1 < n(n+1)/2
Originally posted by DeepThoughtYep. I misread what he is asking for.
While that is true for each chord, I think Wanderingking wants all chords drawable from a given point. So say there are n points, if you add another point you have to add n chords.
But I'm unclear as to what he wants ... it can't be all chords from a given point because he states "no three chords intersect at one point".