Let n be a positive integer. How many multisets can be made using the numbers 1 through
Chapter 0, Problem 21(choose chapter or problem)
Let n be a positive integer. How many multisets can be made using the numbers 1 through n, where each is used at most three times? Be sure to justify your answer. For example, if n D 5, then we would count h1; 2; 2; 3i and h1; 2; 3; 4; 4; 4; 5i, but we would not counth1; 2; 4; 4; 4; 4; 4; 4; 4i(too many 4s) or h3; 4; 6i (6 is not in the range from 1 to n).
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