(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

You are given n identical As and n identical Bs. You are supposed to arrange them in a circle. How many unique arrangements are there?

2. Relevant equations

Use of combinatorics

3. The attempt at a solution

At first, I tried working out the answer if I arrange them in a row. The answer is (2*n)!/(n!*n!). Then I tried to multiply something to this to get the answer. However, I cannot find a way to do so. For example, I tried dividing it by 2*n, but this does not work, because not all the arrangements repeated 2*n times.

I worked out some answers below in case someone needs them.

for n = 1, there is only 1 way {AB}

for n = 2, there are 2 ways {AABB, ABAB}

for n = 3, there are 4 ways. {ABABAB, AABBAB, AABABB, AAABBB}

for n = 4, there are 9 ways if I did not count wrongly {AAAABBBB, AAABBBAB, AAABBABB, AAABABBB, AABAABBB, AABBAABB, AABABABB, AABABBAB, AABBABAB}

Sorry, my combinatorics is not that good. This is all I can do :(

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Combinatorics Problem

**Physics Forums | Science Articles, Homework Help, Discussion**