This is just the number of permutations of the set {0, 0, 0, 1, 1, 1, 2, 2, 2}. There are 9 elements in the set, so there are 9! = 362,880 possible ternary strings with exactly 3 each of 0, 1, and 2.
-5x - 15 > 10 + 20x...subtract 10 from both sides, add 5x to both sides -10 - 15 > 20x + 5x ...simplify -25 > 25x...divide both sides by 25 -25/25 > x ....reduce -1 > x or x < -1 <===