r-sided polygons are formed by joining the vertices of an n-sided polygon. Find the number of polygons that can be formed, none of whose sides coincide with those of the n-sided polygon.
Thank You.

Dear Student,
Please find below the solution to the asked query:

We can do it by stars and bars analogy Read wiki of stars and barsIf we represent a used vertex as  and unused vertex as , then one of thepossible polygon will look like  For above example n=14 and r=4.If the last vertex is unused, then we can assume of this as an arbitrary string of n-2r '' s and r '''s- there are n-rCr such strings and of totalpolygons n-rn fractions do not use last vertex, henceNumber of required polygons=nn-r n-rCr=nn-r n-r!r! n-r-r!=nn-r n-rn-r-1!r! n-2r!=nn-r-1!r! n-2r! Answer

Hope this information will clear your doubts about this topic.

If you have any doubts just ask here on the ask and answer forum and our experts will try to help you out as soon as possible.
Regards

  • 5
What are you looking for?