SOLUTION: Find the number of distinguishable permutations of: 5 Cs, 6 Gs, and 4 Ls

Let T = total number of letters

    L = number of L's

    G = number of G's

    C = number of C's 



Number of distinct arrangements = T!/(C!G!L!)



You can fill in the numbers



n! means "n factorial":  n! = n*(n-1)*(n-2)*...*3*2*1