Big round meeting table !

A factory has 2 n 2^n workers . Every monday there is ameeting held and all of them sit on a big circular table. All the workers are divided into a 1 a_1 type groups each of 2 workers who should sit near each other . they are again divided into a 2 a_2 type groups each consisting of 2 a 1 a_1 type groups which should sit adjacent to each other . this is continued to form a 3 a_3 , a 4 a_4 ... type groups .

Find 2 n + 1 2^{n+1} -(no of ways the workers can sit on the table)


The answer is 4.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...