Let n N and let S = {1, 2, . . . , n}. Let s1 and s2 be strings of length n, each of
Chapter 8, Problem 5(choose chapter or problem)
Let n N and let S = {1, 2, . . . , n}. Let s1 and s2 be strings of length n, each of whose coordinates is an element of S. How many strings of length 3n are there beginning with s1 and ending with s2?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer