Polyfun!!! 3

Find number of 2000 2000 -sided polygon that can be made by joining vertices of a 10000 10000 - sided regular polygon which has atmost one side common with that of polygon \text{atmost one side common with that of polygon} .

Your answer can be expressed as a × ( b c ) \displaystyle a × {b \choose c} where b > c b \gt c and ( b c ) \displaystyle {b \choose c} is Binomial Coefficient . Enter your answer as minimum value of a + b + c a + b + c .


Inspiration Aniket Sanghi

Try similar questions by me


All of my problems are original


Difficulty: \dagger \dagger \dagger \dagger \color{grey}{\dagger}


The answer is 19999.

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.

1 solution

Aryan Sanghi
Jun 1, 2020

This question is equivalent to placing 2000 2000 objects in (10000 - 2000) boxes with exactly one empty box. But, it is in circular fashion. We'll take care of it afterwards.

So, x 1 + x 2 + . . . . . . + x 2000 = 8000 x_1 + x_2 + ...... + x_{2000} = 8000

Let x 1 0 and x 2 , x 3 . . . . x 2000 1 x_1 \geq 0 \text{ and } x_2, x_3 .... x_{2000} \geq 1

No. of ways of distribution = ( 8000 1999 ) \text{No. of ways of distribution } = {8000 \choose 1999}

Now, there are 2000 2000 ways of selecting x i 0 x_i \geq 0

ways = 2000 × ( 8000 1999 ) \text{ways } = 2000 × {8000 \choose 1999}

To take care of circular fashion, we have to multiply it by 10000 10000 and divide it by 2000 2000

total ways = 10000 × ( 8000 1999 ) \color{#3D99F6}{\boxed{\text{total ways } = 10000 × {8000 \choose 1999}}}

a = 10000 , b = 8000 and c = 1999 a = 10000, b = 8000 \text{ and } c = 1999

a + b + c = 19999 \boxed{a + b + c = 19999}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...