Limited access

Upgrade to access all content for this subject

There are $2n$ students sitting at a circular table. The professor has $3$ versions of their Introduction to Combinatorics exam. How many ways can the professor distribute the exams such that no two neighboring students receive the same version?

A

$3^{2n}$

B

$3^{2n-1}*2$

C

$2^{2n}+2$

D

$3^{n}*2^{n}$

E

$2^{2n}$

Select an assignment template