Consider a regular sided polygon. We will get a decagon by joining any points of this sided polygon.
In this polygon, how many decagon can be formed such that they do not have any side common with the sided polygon?
If the answer contains digits and sum of all digits of the answer is , find .
Sum of digits means sum of every individual digits. For example, sum of digits in number is
You may use computational tools
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This problem is actually similar to the Fastidious Librarian , since the simplest wording of the problem is
An alternative interpretation of the problem is
We see the 101 vertices as lined-up balls and 10 to-be-inserted vertices as bars. Note that there cannot be bars at the leftmost and rightmost position at the same time.
We first calculate the number of ways to insert 10 bars into 102 gaps ( 3 1 0 2 ) without concerning if the leftmost and rightmost position is filled, then minus the number of ways to insert 8 bars into 100 gaps ( 8 1 0 0 ) when the leftmost and rightmost position is occupied.
Hence,
( 1 0 1 0 2 ) − ( 8 1 0 0 ) = 2 1 1 1 4 7 7 3 0 7 3 2 4 0
There's nothing special about 1 1 1 , it's just the art of counting.