Given a deck of size d <= upper bound, is there a strategy that works for this card trick?
How many possible strategies are there for this trick?
If there are 7 cards in a deck, and we choose 3 cards, how many suits can you have and still guarantee that you have 2 cards in the same suit?
If n = 3, how big of a deck will not admit a strategy for this card trick?
If you have a set of three letters, how can you encode them using reverse alphabetical order?
Currently 4.0/5 Stars.
This recitation is focused nearly entirely on a card magic trick and the math behind it. Make sure to check out the problem set that goes along with this video. There is a lot of math that was used in this course that is behind this problem, which makes it pretty interesting, although the math is rather dry and complicated and some points. These ideas lead into cryptography in the next and final lecture.