Question 1147096
.
<pre>

This problem is about circular permutations.


The number of distinguishable circular permutations of "n" items is (n-1)!.


In this case the answer is (12-1)! = 11! = 11*10*9*8*7*6*5*4*3*2 = 39916800.
</pre>


Solved.


-----------------


See the lesson

&nbsp;&nbsp;&nbsp;&nbsp;- <A HREF =https://www.algebra.com/algebra/homework/Permutations/Persons-sitting-around-a-circular-table.lesson>Persons sitting around a cicular table</A> 

in this site.


Also, &nbsp;you have this free of charge online textbook in ALGEBRA-II in this site

&nbsp;&nbsp;&nbsp;&nbsp;- <A HREF=https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson>ALGEBRA-II - YOUR ONLINE TEXTBOOK</A>.


The referred lesson is the part of this online textbook under the topic &nbsp;"<U>Combinatorics: Combinations and permutations</U>". 



Save the link to this textbook together with its description


Free of charge online textbook in ALGEBRA-II
https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson


into your archive and use when it is needed.