A university is determining the dates for tests in January. There can be a test on every day in January(all $31 $of them), but each two tests have to have at least $2$ free days in between them. (so if there was a test on Monday, the next one can be on Thursday or later)
How many ways are there to arrange tests in this manner?
I'm guessing inclusion-exclusion would be a way to solve this, but I'm not really sure how to put it because everything I've wanted to do seems to overcount things. Maybe it could be seen as a multiset and look for specific permutations but I'm really not sure.
I would really appreciate any hints whatsoever.
You want to see in how many ways you can arrange $6$ letters T ("test") and $25$ letters F ("free day") in a row so that there are at least two letters F between each two letters T?
To solve this, extract those (five) pairs of letters F between T's, and you get to arrange, freely, $6$ letters T and $15$ letters F in the row. This can be done in $\binom{21}{6}$ ways.
Example:
$$FFTFFFFFTFFFTFFFFFFTFFTFFFFFFTF$$
(exam on Jan 3rd, 9th, 13th, 20th, 23th 30th) maps into the sequence:
$$FFTFFFTFTFFFFTTFFFFTF$$
and vice versa.