# How many ways are there of coloring $n$ numbers? [duplicate]

Possible Duplicate:
In how many ways can we colour $n$ baskets with $r$ colours?

How many ways are there of coloring $n$ numbers $1, 2, 3, \dots, n$ ($n \ge 2$) in a circle $(C)$ with $p$ colors ($p \ge 2$), such that each number is given one color, and every color isn't used for two adjacent number? Thanks!

## marked as duplicate by joriki, Phira, Thomas, Brian M. Scott, EmilyNov 5 '12 at 17:12

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

• It is going to be something like $p(p-1)^{n-1}(p-2)$, but for example already for $p=2$ it is not that straightforward (depends also on parity of $n$). – Berci Nov 5 '12 at 16:03
• This is not a duplicate because baskets are indistinguishable and numbers are not. – sperners lemma Nov 5 '12 at 18:12
• @sperners: I don't think I've ever seen indistinguishable baskets, but it doesn't matter, since my answer to that question treats them as distinguishable. – joriki Nov 5 '12 at 20:18