Conservative Sequences
Problem
A finite sequence with terms is called conservative if
Let be the number of permutations of that form conservative sequences, and the number of such permutations that moreover start with . By convention .
1. Find and . 2. Find a closed formula for the sequence . 3. Find a closed formula for the sequence .
Answer
Solution
| Difficulty | 9/10 |
|---|---|
| Topics | combinatorics, Counting, Recursion, sequences, Casework |
Whiteboard
Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.
Discussion
Ask questions, share alternate solutions, and use LaTeX freely.
Log in to join the discussion.
No comments yet.