Challenge

In combinatorics, a necklace is a loop of string, having \(n\) beads of \(a\) colors. In this challenge, the student is tasked with finding the values for \(n = 2,\ a = 2,\) and \(n = 3,\ a = 3.\) Before attempting this challenge, the student must know how to count in binary and ternary.

Webpages