What is the smallest string containing all permutations of a set of n elements for n=14?
·You have an n episode tv series. You want to watch the episodes in every order possible. What is the least number of episodes that you would have to watch?
·Over lapping is allowed. For example, in the case of n=2, watching episode 1, then 2, then 1 again, would fit the criteria.
·The orders must be continuous. For example, (1,2,1,3) does NOT contain the sequence (1,2,3)